✦ LIBER ✦

Numerical canonical factorization algorithms and their application

✍ Scribed by R.P. Tarasov

Publisher: Elsevier Science
Year: 1990
Weight: 817 KB
Volume: 30
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(90)90070-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Univariate Polynomials: Nearly Optimal A

Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

✍ Victor Y. Pan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 552 KB

To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of t

Canonical correlations and generalized S

Canonical correlations and generalized SVD: Applications and new algorithms

✍ L.Magnus Ewerbring; Franklin T. Luk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 995 KB

Hankel Matrices and Their Applications t

Hankel Matrices and Their Applications to the Numerical Factorization of Polynomials

✍ Mohammad A. Hasan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Generalized canonical correlations and t

Generalized canonical correlations and their applications to experimental data

✍ Paul Horst 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 834 KB

Some non-standard regularizing algorithm

Some non-standard regularizing algorithms and their numerical realization

✍ A.B. Bakushinskii; V.S. Sizkov 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 482 KB

Orthogonal arrays: An introduction and t

Orthogonal arrays: An introduction and their application in optimizing underrelaxation factors in ‘simple’-based algorithm

✍ R. Gopinath; V. Ganesan 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 786 KB

The primary aim of this paper is to demonstrate how the 'design-of-experiments' techniques which are successful in physical experiments could also be adapted to a numerical simulation code. As an example this technique is applied to a general finite difference code used for predicting threedimensio