The inside pages of the commonly used computer algorithms (second edition) new(Chinese Edition) - Softcover
Synopsis
.publisher:Tsinghua University Press.description:Paperback. Pub Date: 1995 Pages: 373 Publisher: Tsinghua University Press. commonly used computer algorithm describes the basic algorithm design and analysis methods. and discussed in detail engineering. effective algorithm. Commonly used computer
"synopsis" may belong to another edition of this title.
Search results for The inside pages of the commonly used computer algorithms...
Stock Image
The inside pages of the commonly used computer algorithms (second edition) new(Chinese Edition)(Old-Used)
Published by
Tsinghua University Press, 2000
ISBN 10: 7302019584
ISBN 13: 9787302019589
Used
paperback
Seller: liu xing, Nanjing, JS, China
Seller rating 5 out of 5 stars
paperback. Condition: Good. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 1995 Pages: 373 Publisher: Tsinghua University Press. commonly used computer algorithm describes the basic algorithm design and analysis methods. and discussed in detail engineering. effective algorithm. Commonly used computer algorithms is divided into 12 chapters. The main contents include: the algorithm and its basic design and analysis of algorithms. polynomial. matrix and linear algebra equations. matrix eigenvalue calculation of non-linear equations and equations. interpolation and approximation. numerical differentiation and numerical integration. Numerical Solution of Ordinary Differential Problems. Continued Fractions and its calculation method. a fast algorithm for digital signal processing. non-numerical problems commonly used algorithm. Each chapter is accompanied by exercises. In order to facilitate the readers to understand. commonly used computer algorithms mainly focus on the analysis of the algorithm description and examples. and omitted some tedious mathematical proof process. For most algorithms. the book gives a detailed calculation steps. Commonly used computer algorithms course for non-mathematics Higher science and engineering colleges commonly used computer algorithms and numerical analysis textbooks. reference as the majority of engineering and technical personnel. Due to the development of computer technology. many complex numerical problems can be resolved. A mathematical problem. and even a numerical formula. how to achieve on the computer. which will produce new problems in the computer processing calculation process. which is often encountered in the practical application of engineering topics. The first edition of this book came out in 1989. the book introduces the basic methods of algorithm analysis. with an emphasis on practical engineering effective algorithm. It includes a general numerical analysis courses at the same time stressed that the analysis of the algorithm. as well as the detailed description of the algorithm. Author after years of teaching practice. as well as algorithms careful study. and with reference to the domestic and foreign new algorithm research. modified and supplemented edition focuses on the following aspects: increase the basic algorithm design ; Increase preliminary discussions NP problem; analysis algorithm stability. focusing on three term recurrence relation analysis; the Continued Fractions its calculations as a separate chapter. highlighting Continued Fractions algorithm design. and all of Continued Fractions algorithm has been modified; supplement some other specific algorithm. such as non-linear equations Aitken iteration method. matrix QR decomposition using orthogonal polynomials curve fitting. Gaussian Quadrature law. In addition. made some small changes to the format of the book all algorithm. easy to call each other. but also conducive to rewrite the algorithm into the program. The book is divided into 12 chapters. Chapter 1 discusses the basic concept of the algorithm and the basic design methods. and describes an algorithm description language used in this book. Chapter 2 focuses on the content analysis algorithms. including: errors and computational error analysis. stability analysis of the algorithm. the time complexity of the algorithm. space complexity and algorithms optimal problem. the adaptive algorithm NP preliminary discussion of issues. The stability analysis of the three term recurrence relation and its algorithm. and a preliminary discussion of the NP problems. in general textbooks rarely introduced. Chapter 3 discusses the basics of the polynomial. Value polynomial algorithms and cut Chebyshev orthogonal polynomials. the polynomial can be used to approximate calculation of the function values. the best uniform approximation tools discussed in Chapter 7. Fundamental theorem of this chapter other relevant polynomial alg. Seller Inventory # FV065488