Hasil Pencarian  ::  Simpan CSV :: Kembali

"The first part of the book (basic methods) covers convergent and divergent series, Chebyshev expansions, numerical quadrature, and recurrence relations. Its focus is on the computation of special functions; however, it is suitable for general numerical courses. Pseudoalgorithms are given to help students write their own algorithms. In addition to these basic tools, the authors discuss other useful and efficient methods, such as methods for computing zeros of special functions, uniform asymptotic expansions, Pad approximations, and sequence transformations. The book also provides specific algorithms for computing several special functions (like Airy functions and parabolic cylinder functions, among others)."

"Studies the use of scientific computation as a tool in attacking a number of mathematical problems and conjectures. In this case, scientific computation refers primarily to computations that are carried out with a large number of significant digits, for calculations associated with a variety of numerical techniques such as the (second) Remez algorithm in polynomial and rational approximation theory, Richardson extrapolation of sequences of numbers, the accurate finding of zeros of polynomials of large degree, and the numerical approximation of integrals by quadrature techniques. The goal of this book is not to delve into the specialized field dealing with the creation of robust and reliable software needed to implement these high-precision calculations, but rather to emphasize the enormous power that existing software brings to the mathematician's arsenal of weapons for attacking mathematical problems and conjectures. Scientific Computation on Mathematical Problems and Conjectures includes studies of the Bernstein Conjecture of 1913 in polynomial approximation theory, the "1/9" Conjecture of 1977 in rational approximation theory, the famous Riemann Hypothesis of 1859, and the Polya Conjecture of 1927. The emphasis of this monograph rests strongly on the interplay between hard analysis and high-precision calculations."

"Matrix functions are of growing interest due to their fascinating theory and the many applications in which they provide insight and succinct solutions. Functions of Matrices: Theory and Computation gives a thorough treatment of the theory of matrix functions and numerical methods for computing them, as well as an overview of applications."

"Proses Markov yang dinyatakan dengan suatu probabilitas bersyarat P {Xn = in | Xn-1 = in-1, .., X1 = i1} = P {Xn = in | Xn-1 = in-1}dari suatu kejadian yang akan datang, jika diberikan suatu kejadian dimasa lalu dan keadaan sekarang X = i , adalah tidak bergantung pada kejadian dimasa lalu tetapi bergantung pada keadaan sekarang dari proses. Pengembangan sifat Markov ini berguna sekali dalam menganalisis suatu sistem antrian dengan pola kedatangan berkelompok dan kemampuan pelayanan sebesar k pada suatu unit waktu."