✦ LIBER ✦

A Fast Algorithm for the Calculation of the Roots of Special Functions

✍ Scribed by Glaser, Andreas; Liu, Xiangtao; Rokhlin, Vladimir

Book ID: 118191003
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 298 KB
Volume: 29
Category: Article
ISSN: 1064-8275
DOI: 10.1137/06067016x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the estimation of a

A fast algorithm for the estimation of autocorrelation functions

✍ Lopresti, P.; Suri, H. 📂 Article 📅 1974 🏛 IEEE ⚖ 479 KB

A fast numerical algorithm for the integ

A fast numerical algorithm for the integration of rational functions

✍ Dante V. Manna; Luis A. Medina; Victor H. Moll; Armin Straub 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 259 KB

A fast algorithm for macromolecular pack

A fast algorithm for macromolecular packing calculation

✍ Mande, S. C. ;Suguna, K. 📂 Article 📅 1989 🏛 International Union of Crystallography 🌐 English ⚖ 353 KB

Fast Algorithm for Calculation of the Un

Fast Algorithm for Calculation of the Union-Based Probability

✍ Jancovic, P. 📂 Article 📅 2007 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 131 KB

A fast algorithm for calculation of the

A fast algorithm for calculation of the distance matrix of a molecule

✍ Malcom Bersohn 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB 👁 2 views

A fast algorithm for the recursive calcu

A fast algorithm for the recursive calculation of dominant singular subspaces

✍ N. Mastronardi; M. Van Barel; R. Vandebril 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 412 KB

In many engineering applications it is required to compute the dominant subspace of a matrix A of dimension m × n, with m?n. Often the matrix A is produced incrementally, so all the columns are not available simultaneously. This problem arises, e.g., in image processing, where each column of the mat