The following pages link to Horst Hollatz (Q587825):
Displaying 50 items.
- (Q677910) (redirect page) (← links)
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations (Q677911) (← links)
- A uniform error bound for the overrelaxation methods (Q677919) (← links)
- Cholesky factorization of semidefinite Toeplitz matrices (Q677932) (← links)
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
- Incremental norm estimation for dense and sparse matrices (Q698566) (← links)
- A note on computing the generalized inverse \(A_{T,S}^{(2)}\) of a matrix \(A\) (Q700896) (← links)
- On the synthesis of fast algorithms for signal processing (Q753422) (← links)
- Interval-constrained matrix balancing (Q758125) (← links)
- Iterative algorithms for large stochastic matrices (Q808164) (← links)
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices (Q808165) (← links)
- On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem (Q808168) (← links)
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems (Q808173) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- The Chebyshev solution of certain matrix equations (Q920580) (← links)
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values (Q1095586) (← links)
- A variable transformation method for solving linear absolute-value objective-function problems with linear constraints (Q1095607) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
- Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints (Q1108934) (← links)
- Truncated incomplete factorization for conjugate-gradient methods in two and three dimensions (Q1111332) (← links)
- An improved multi-parameter adjustment algorithm for inverse eigenvalue problems (Q1114348) (← links)
- Nonlinear programming approach to automated topology optimization (Q1118360) (← links)
- On accelerating Newton's method based on a conic model (Q1118983) (← links)
- A note on order preserving matchings (Q1121175) (← links)
- On semiiterative methods generated by Faber polynomials (Q1124270) (← links)
- A note on the SSOR and USSOR iterative methods applied to p-cyclic matrices (Q1124271) (← links)
- An interval maximum entropy method for a discrete minimax problem (Q1126620) (← links)
- A class of Lanczos-like algorithms implemented on parallel computers (Q1179222) (← links)
- A systolic array design for matrix system solution by the symmetric bordering method (Q1186179) (← links)
- On the monotone convergence of algorithmic models (Q1186532) (← links)
- A new class of decomposition for symmetric systems (Q1198362) (← links)
- A stationary iterative pseudoinverse algorithm (Q1267019) (← links)
- A generalized successive overrelaxation method for least squares problems (Q1267026) (← links)
- Iterative methods to compute weighted normal pseudosolutions with positive definite weights (Q1280950) (← links)
- Weighted FOM and GMRES for solving nonsymmetric linear systems (Q1281791) (← links)
- A Korovkin-type theory for finite Toeplitz operators via matrix algebras (Q1293999) (← links)
- A parallel algorithm for solving Toeplitz linear systems (Q1294265) (← links)
- A new implementation of EN method (Q1294333) (← links)
- Tight complexity bounds for the two-dimensional real knapsack problem (Q1300669) (← links)
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems (Q1301312) (← links)
- Symmetric schemes for computing the minimum eigenvalue of a symmetric Toeplitz matrix (Q1301313) (← links)
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms (Q1307276) (← links)
- On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (Q1318656) (← links)
- Scalable iterative solution of sparse linear systems (Q1323641) (← links)
- A systolic array architecture for QR decomposition of block structured sparse systems (Q1334870) (← links)
- Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS) (Q1334875) (← links)
- Interpolation by conic model for unconstrained optimization (Q1343680) (← links)
- Minimization of certain cost functions with error bounds (Q1356989) (← links)
- Avoiding breakdown in variants of the BI-CGSTAB algorithm (Q1368763) (← links)
- Optimal \(p\)-cyclic SOR for complex spectra (Q1368770) (← links)
