Iterative Methods for Overflow Queuing Models II.
Iterative methods for solving large systems of linear equations
Iterative methods for solving the dual formulation arising from image restoration.
Iterative methods for the numerical solution of the boundary value problem of elasticity [Abstract of thesis]
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
For solving linear complementarity problems LCP more attention has recently been paid on a class of iterative methods called the matrix-splitting. But up to now, no paper has discussed the effect of preconditioning technique for matrix-splitting methods in LCP. So, this paper is planning to fill in this gap and we use a class of preconditioners with generalized Accelerated Overrelaxation (GAOR) methods and analyze the convergence of these methods for LCP. Furthermore, Comparison between our methods...
Iterative Nachverbesserung mit Fehlereingrenzung der Cholesky-Faktoren von Stieltjes-Matrizen.
Iterative schemes for high order compact discretizations to the exterior Helmholtz equation∗
We consider high order finite difference approximations to the Helmholtz equation in an exterior domain. We include a simplified absorbing boundary condition to approximate the Sommerfeld radiation condition. This yields a large, but sparse, complex system, which is not self-adjoint and not positive definite. We discretize the equation with a compact fourth or sixth order accurate scheme. We solve this large system of linear equations with a Krylov subspace iterative method. Since the method converges...
Iterative schemes for high order compact discretizations to the exterior Helmholtz equation∗
We consider high order finite difference approximations to the Helmholtz equation in an exterior domain. We include a simplified absorbing boundary condition to approximate the Sommerfeld radiation condition. This yields a large, but sparse, complex system, which is not self-adjoint and not positive definite. We discretize the equation with a compact fourth or sixth order accurate scheme. We solve this large system of linear equations with a Krylov subspace iterative method. Since the method converges...
Iterative solution of rectangular systems of linear algebraic equations
Joint domain-decomposition -LU preconditioners for saddle point problems.
Kellogg's iterations for general complex matrix
Krein spaces numerical ranges and their computer generation.
Krylov subspace spectral methods for variable-coefficient initial-boundary value problems.
-curve curvature bounds via Lanczos bidiagonalization.
-norm of iterates and the spectral radius of matrices
factorizations
La méthode de Cholesky
L’objet de cet article est de présenter le manuscrit original, jusqu’alors inconnu, de Cholesky où il explique sa méthode de résolution des systèmes d’équations linéaires. Le contexte historique est précisé après une brève biographie. La méthode des moindres carrés et son application à la topographie, ainsi que les diverses méthodes directes de résolution des systèmes linéaires sont discutées. Ensuite, la diffusion de la méthode de Cholesky est retracée et l’on donne une analyse détaillée du manuscrit...
Laconicity and redundancy of Toeplitz matrices.
L'affectation exponentielle et le problème du plus court chemin dans un graphe
Lanczos-like algorithm for the time-ordered exponential: The -inverse problem
The time-ordered exponential of a time-dependent matrix is defined as the function of that solves the first-order system of coupled linear differential equations with non-constant coefficients encoded in . The authors have recently proposed the first Lanczos-like algorithm capable of evaluating this function. This algorithm relies on inverses of time-dependent functions with respect to a non-commutative convolution-like product, denoted by . Yet, the existence of such inverses, crucial to...