The following pages link to Jane K. Cullum (Q1917420):
Displaying 45 items.
- (Q200463) (redirect page) (← links)
- (Q675680) (redirect page) (← links)
- Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG (Q675681) (← links)
- Matrix-free preconditioning using partial matrix estimation (Q855287) (← links)
- Scalable algebraic multigrid on 3500 processors (Q871187) (← links)
- A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems (Q1062424) (← links)
- The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization (Q1135080) (← links)
- Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization (Q1161032) (← links)
- (Q1249929) (redirect page) (← links)
- An algorithm for minimizing a differentiable function subject to box constraints and errors (Q1249930) (← links)
- Some remarks on the symmetric rank-one update (Q1249931) (← links)
- A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures (Q1294603) (← links)
- A generalized nonsymmetric Lanczos procedure (Q1330632) (← links)
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\) (Q1917421) (← links)
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems (Q1923870) (← links)
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method (Q2706438) (← links)
- A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices (Q3667849) (← links)
- (Q3692703) (← links)
- (Q3742612) (← links)
- (Q3862954) (← links)
- (Q3878647) (← links)
- (Q3975057) (← links)
- (Q4127646) (← links)
- (Q4155751) (← links)
- The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix (Q4172855) (← links)
- (Q4192888) (← links)
- The Effective Choice of the Smoothing Norm in Regularization (Q4192924) (← links)
- Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms (Q4785775) (← links)
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations (Q4786440) (← links)
- A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices (Q4870624) (← links)
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems (Q4880252) (← links)
- (Q4913709) (← links)
- Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms (Q5317893) (← links)
- Perturbations of Optimal Control Problems (Q5531252) (← links)
- A Maximum Principle for Optimal Control Problems in which the Phase Space Constraint Set is Closed (Q5543626) (← links)
- Discrete Approximations to Continuous Optimal Control Problems (Q5563608) (← links)
- (Q5587515) (← links)
- (Q5587516) (← links)
- (Q5620141) (← links)
- (Q5628783) (← links)
- Numerical Differentiation and Regularization (Q5630522) (← links)
- Finite-Dimensional Approximations of State-Constrained Continuous Optimal Control Problems (Q5655991) (← links)
- An explicit procedure for discretizing continuous, optimal control problems (Q5921059) (← links)
- An explicit procedure for discretizing continuous, optimal control problems (Q5921272) (← links)
- Pseudospectra analysis, nonlinear eigenvalue problems, and studying linear systems with delays (Q5942333) (← links)
