The following pages link to William B. Gragg (Q761012):
Displayed 50 items.
- (Q170392) (redirect page) (← links)
- The numerically stable reconstruction of Jacobi matrices from spectral data (Q761014) (← links)
- A divide and conquer method for unitary and orthogonal eigenproblems (Q920577) (← links)
- On the partial realization problem (Q1055376) (← links)
- On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices (Q1090062) (← links)
- The QR algorithm for unitary Hessenberg matrices (Q1091757) (← links)
- Singular value decompositions of complex symmetric matrices (Q1097636) (← links)
- Downdating of Szegö polynomials and data-fitting applications (Q1194528) (← links)
- Matrix interpretations and applications of the continued fraction algorithm (Q1223116) (← links)
- On singular values of Hankel operators of finite rank (Q1263059) (← links)
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle (Q1802166) (← links)
- An analogue for Szegő polynomials of the Clenshaw algorithm (Q1802168) (← links)
- Numerical experience with a superfast real Toeplitz solver (Q1825588) (← links)
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs (Q2365723) (← links)
- On a theorem of Koenig (Q2523166) (← links)
- Truncation error bounds for g-fractions (Q2533820) (← links)
- An Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix (Q3069295) (← links)
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices (Q3147171) (← links)
- (Q3217515) (← links)
- (Q3217521) (← links)
- Two Constructive Results in Continued Fractions (Q3343087) (← links)
- Discrete Least Squares Approximation by Trigonometric Polynomials (Q3359714) (← links)
- (Q3730927) (← links)
- Superfast Solution of Real Positive Definite Toeplitz Systems (Q3806667) (← links)
- (Q3823720) (← links)
- On Least Squares Exponential Sum Approximation With Positive Coefficients (Q3859177) (← links)
- (Q3955810) (← links)
- On fast computation of superdiagonal Padé fractions (Q3966993) (← links)
- (Q3974761) (← links)
- $O( n^2 )$ Reduction Algorithms for the Construction of a Band Matrix from Spectral Data (Q3977055) (← links)
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization (Q4114699) (← links)
- A Stable Variant of the Secant Method for Solving Nonlinear Equations (Q4131537) (← links)
- (Q4157118) (← links)
- Numerically Stable Methods for Updating Regressions (Q4181834) (← links)
- (Q4257499) (← links)
- (Q4296886) (← links)
- (Q4315438) (← links)
- Algorithm 686: FORTRAN subroutines for updating the QR decomposition (Q4371659) (← links)
- (Q4721516) (← links)
- (Q4764036) (← links)
- Optimal Error Bounds for the Newton–Kantorovich Theorem (Q4772092) (← links)
- Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift (Q4780377) (← links)
- Some inverse eigenproblems for Jacobi and arrow matrices (Q4850235) (← links)
- Computation of Gauss-Kronrod quadrature rules (Q4955860) (← links)
- On Extrapolation Algorithms for Ordinary Initial Value Problems (Q5508645) (← links)
- Generalized Multistep Predictor-Corrector Methods (Q5553628) (← links)
- (Q5561501) (← links)
- Truncation error bounds for $\pi$-fractions (Q5599302) (← links)
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis (Q5648626) (← links)
- Polynomial zerofinders based on Szegő polynomials (Q5929291) (← links)