µn¤J
¡U
µù¥U
¡U
·|û¤¤¤ß
¡U
µ²±b
¡U
°ö°V½Òµ{
Å]ªk§Ì¤l
¡U
¦Û¸ê¥Xª©
¡U
¹q¤l®Ñ
¡U
«ÈªA¤¤¤ß
¡U
´¼¼z«¬¥ßÊ^·|û
®Ñ¦W
¥Xª©ªÀ
§@ªÌ
isbn
½s¸¹
5050Å]ªk²³Äw
|
NG®Ñ«°
|
°ê»Ú¯Å«~µP½Òµ{
|
Àu´f³qª¾
|
ÅRÆE^¶¯µ¼Öºë¿ï
|
·L³B²z¾÷¡þ³æ´¹¤ù²Õ¦X»y¨¥±Ð¾Ç½d¥»(ªþCD)
¦¹§@ªÌµL¬ÛÃö®ÑÄy
¤å¾Ç¤p»¡
¤å¾Ç
¡U
¤p»¡
°ÓºÞ³Ð§ë
°]¸g§ë¸ê
¡U
¦æ¾P¥øºÞ
¤H¤åÃÀ§{
©v±Ð¡Bõ¾Ç
ªÀ·|¡B¤H¤å¡B¥v¦a
ÃÀ³N¡B¬ü¾Ç
¡U
¹q¼vÀ¸¼@
Ày§Ó¾i¥Í
ÂåÀø¡B«O°·
®Æ²z¡B¥Í¬¡¦Ê¬ì
±Ð¨|¡B¤ß²z¡BÀy§Ó
¶i׾Dzß
¹q¸£»Pºô¸ô
¡U
»y¨¥¤u¨ã
Âø»x¡B´Á¥Z
¡U
x¬F¡Bªk«ß
°Ñ¦Ò¡B¦Ò¸Õ¡B±Ð¬ì¥Î®Ñ
¬ì¾Ç¤uµ{
¬ì¾Ç¡B¦ÛµM
¡U
¤u·~¡B¤uµ{
®a®x¿Ë¤l
®a®x¡B¿Ë¤l¡B¤H»Ú
«C¤Ö¦~¡Bµ£®Ñ
ª±¼Ö¤Ñ¦a
®È¹C¡B¦a¹Ï
¡U
¥ð¶¢®T¼Ö
º©µe¡B´¡¹Ï
¡U
¨î¯Å
AN INTRODUCTON TO NUMERICAL METHODS AND ANALYSIS 2/E
§@ªÌ¡G
EPPERSON
¤ÀÃþ¡G
°Ñ¦Ò¡E¦Ò¸Õ¡E±Ð¬ì®Ñ
¡þ
¤j±M¾Ç°|±Ð¬ì®Ñ
ÂO®Ñ¨t¦C¡G¤j¾Ç¦@¦P
¥Xª©ªÀ¡G
¥þµØ¹Ï®Ñ
¥Xª©¤é´Á¡G2008/1/1
ISBN¡G9780470049631
®ÑÄy½s¸¹¡Gkk0192137
¶¼Æ¡G572
©w»ù¡G
1200
¤¸
®Ñ»ùY¦³²§°Ê¡A¥H¥Xª©ªÀ¹ê»Ú©w»ù¬°·Ç
¼È°±³c°â
¼ÈµL¨ÑÀ³°Ó¡G´M§ä¨Ñ³f°Ó¤¤(¤]¦³¥i¯à¥Xª©ªÀ¤wµ²§ô)¡C
¹ÎÁʼƳ̧C¬° 20 ¥»¥H¤W
µû»ù¼Æ¡G
(½Ð±N·Æ¹«²¾¦Ü¬P¬P³B¶i¦æµû»ù)
¥Ø«e¥§¡µû»ù¡G
¤å¦r³sµ²
½Æ»s»yªk
AN INTRODUCTON TO NUMERICAL METHODS AND ANALYSIS 2/E
¹Ï¤ù³sµ²
½Æ»s»yªk
¤À
¨É
¤º®e²¤¶
¦PÃþ±ÀÂË
內容簡介
The objective of this book is for the reader to learn where approximation methods come from, why they work, why they sometimes don't work, and when to use which of many techniques that are available, and to do all this in a way that emphasizes readability and usefulness to the numerical methods novice. Each chapter and each section begins with the basic, elementary material and gradually builds up to more advanced topics. The text begins with a review of the important calculus results, and why and where these ideas play an important role throughout the book. Some of the concepts required for the study of computational mathematics are introduced, and simple approximations using Taylor's Theorem are treated in some depth. The exposition is intended to be lively and "student friendly". Exercises run the gamut from simple hand computations that might be characterized as "starter exercises", to challenging derivations and minor proofs, to programming exercises.
¹q¤uªk³W(²Ä¤ª©)
°ò¦«æ±Ï
ªø´Á·ÓÅU(²Ä¤Eª©)
¨Ó¤WÅÞ¿è½ÒÅo¡I(²Ä¥|
¶¼®Æ¹ê°ÈÁ`½Æ²ß(²Ä¤T
¤ÀªR¤Æ¾Ç¹êÅç(²Ä¤ª©
²Îp¾Ç(²Ä¤ª©)
µø¥úÃIJz¾Ç(²Ä¤ª©)
°]°ÈºÞ²z²z½×»PÀ³¥Î(
ÂåÀø¦æ¾PºÞ²z¡GAI®É
¬°¤F«O»Ù±zªºÅv¯q¡A·sµ·¸ôºô¸ô®Ñ©±©ÒÁʶRªº°Ó«~§¡¨É¦³¨ì³f¤C¤ÑªºÅ²½à´Á¡]§t¨Ò°²¤é¡^¡C°h¦^¤§°Ó«~¥²¶·©óŲ½à´Á¤º±H¦^¡]¥H¶lÂW©Î¦¬°õÁp¬°¾Ì¡^¡A¥B°Ó«~¥²¶·¬O¥þ·sª¬ºA»P§¹¾ã¥]¸Ë(°Ó«~¡Bªþ¥ó¡B¤º¥~¥]¸Ë¡BÀH³f¤å¥ó¡BÃØ«~µ¥)¡A§_«h®¤¤£±µ¨ü°h³f¡C