The following pages link to David S. Scott (Q787569):
Displaying 20 items.
- New structural properties of strings generated by leading digits of \(2^ n\) (Q787571) (← links)
- The complexity of interpolating given data in three space with a convex function of two variables (Q1061327) (← links)
- Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer (Q1072331) (← links)
- On the accuracy of the Gerschgorin circle theorem for bounding the spread of a real symmetric matrix (Q1073873) (← links)
- (Q1161243) (redirect page) (← links)
- Solving sparse symmetric definite quadratic lambda-matrix problems (Q1161244) (← links)
- Implementing Lanczos-like algorithms on hypercube architectures (Q1330644) (← links)
- Parallel block Jacobi eigenvalue algorithms using systolic arrays (Q1820556) (← links)
- Computing a Few Eigenvalues and Eigenvectors of a Symmetric Band Matrix (Q3223800) (← links)
- (Q3730989) (← links)
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices (Q3738470) (← links)
- Minimal mesh embeddings in binary hypercubes (Q3806842) (← links)
- (Q3909912) (← links)
- Solving Symmetric-Definite Quadratic $\lambda $-Matrix Problems without Factorization (Q3935375) (← links)
- The Advantages of Inverted Operators in Rayleigh–Ritz Approximations (Q3935376) (← links)
- Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization (Q3936103) (← links)
- (Q3968380) (← links)
- The Lanczos Algorithm with Selective Orthogonalization (Q4191505) (← links)
- How to Make the Lanczos Algorithm Converge Slowly (Q4191506) (← links)
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems (Q4693193) (← links)
