國立虎尾科技大學 |

D-finite functions

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	D-finite functions/ by Manuel Kauers.
作者:	Kauers, Manuel.
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	x, 664 p. :illustrations, digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Symbolic and Algebraic Manipulation. -
電子資源:	https://doi.org/10.1007/978-3-031-34652-1
ISBN:	9783031346521

D-finite functions
Kauers, Manuel.

D-finite functions[electronic resource] /by Manuel Kauers. - Cham :Springer Nature Switzerland :2023. - x, 664 p. :illustrations, digital ;24 cm. - Algorithms and computation in mathematics ;v. 30. - Algorithms and computation in mathematics ;v.5..

Chapter. 1. Background and fundamental concepts -- Chapter. 2. The recurrence case in one variable -- Chapter. 3. The differential case in one variable -- Chapter. 4. Operators -- Chapter. 5. Summation and integration -- Answers to Exercises -- Software -- Notations -- References -- Index.

Defined as solutions of linear differential or difference equations with polynomial coefficients, D-finite functions play an important role in various areas of mathematics. This book is a comprehensive introduction to the theory of these functions with a special emphasis on computer algebra algorithms for computing with them: algorithms for detecting relations from given data, for evaluating D-finite functions, for executing closure properties, for obtaining various kinds of "explicit" expressions, for factoring operators, and for definite and indefinite symbolic summation and integration are explained in detail. The book comes "with batteries included" in the sense that it requires no background in computer algebra as the relevant facts from this area are summarized in the beginning. This makes the book accessible to a wide range of readers, from mathematics students who plan to work themselves on D-finite functions to researchers who want to apply the theory to their own work. Hundreds of exercises invite the reader to apply the techniques in the book and explore further aspects of the theory on their own. Solutions to all exercises are given in the appendix. When algorithms for D-finite functions came up in the early 1990s, computer proofs were met with a certain skepticism. Fortunately, these times are over and computer algebra has become a standard tool for many mathematicians. Yet, this powerful machinery is still not as widely known as it deserves. This book helps to spread the word that certain tasks can be safely delegated to a computer algebra system, and also what the limitations of these techniques are.

ISBN: 9783031346521

Standard No.: 10.1007/978-3-031-34652-1doiSubjects--Topical Terms:

669944
Symbolic and Algebraic Manipulation.

LC Class. No.: QA372

Dewey Class. No.: 515.354

D-finite functions
LDR:02937nam a2200337 a 4500 001 1119838
003 DE-He213
005 20231108074108.0
006 m d
007 cr nn 008maaau
008 240612s2023 sz s 0 eng d
020 $a 9783031346521 $q (electronic bk.)
020 $a 9783031346514 $q (paper)
024 7 $a 10.1007/978-3-031-34652-1 $2 doi
035 $a 978-3-031-34652-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA372
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 515.354 $2 23
090 $a QA372 $b .K21 2023
100 1 $a Kauers, Manuel. $3 784044
245 1 0 $a D-finite functions $h [electronic resource] / $c by Manuel Kauers.
260 $a Cham : $c 2023. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a x, 664 p. : $b illustrations, digital ; $c 24 cm.
490 1 $a Algorithms and computation in mathematics ; $v v. 30
505 0 $a Chapter. 1. Background and fundamental concepts -- Chapter. 2. The recurrence case in one variable -- Chapter. 3. The differential case in one variable -- Chapter. 4. Operators -- Chapter. 5. Summation and integration -- Answers to Exercises -- Software -- Notations -- References -- Index.
520 $a Defined as solutions of linear differential or difference equations with polynomial coefficients, D-finite functions play an important role in various areas of mathematics. This book is a comprehensive introduction to the theory of these functions with a special emphasis on computer algebra algorithms for computing with them: algorithms for detecting relations from given data, for evaluating D-finite functions, for executing closure properties, for obtaining various kinds of "explicit" expressions, for factoring operators, and for definite and indefinite symbolic summation and integration are explained in detail. The book comes "with batteries included" in the sense that it requires no background in computer algebra as the relevant facts from this area are summarized in the beginning. This makes the book accessible to a wide range of readers, from mathematics students who plan to work themselves on D-finite functions to researchers who want to apply the theory to their own work. Hundreds of exercises invite the reader to apply the techniques in the book and explore further aspects of the theory on their own. Solutions to all exercises are given in the appendix. When algorithms for D-finite functions came up in the early 1990s, computer proofs were met with a certain skepticism. Fortunately, these times are over and computer algebra has become a standard tool for many mathematicians. Yet, this powerful machinery is still not as widely known as it deserves. This book helps to spread the word that certain tasks can be safely delegated to a computer algebra system, and also what the limitations of these techniques are.
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 2 4 $a Differential Equations. $3 681826
650 1 4 $a Discrete Mathematics. $3 796600
650 0 $a Difference equations. $3 527665
650 0 $a Differential equations, Linear. $3 528154
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Algorithms and computation in mathematics ; $v v.5. $3 882177
856 4 0 $u https://doi.org/10.1007/978-3-031-34652-1
950 $a Mathematics and Statistics (SpringerNature-11649)