Algorithm 37. Solution of sparse linear equation systems
Displaying 221 – 240 of 314
Algorithm 60. Determination of the Jordan canonical form of real matrix
K. Wrześniowski, Elżbieta Winkel (1978)
Applicationes Mathematicae
Algorithm 61. The solution of a certain linear equation system
Z. Kasperski (1978)
Applicationes Mathematicae
Algorithm 82. Stepwise selection of discriminative variables by the use of the Wilks criterion
Anna Bartkowiak (1982)
Applicationes Mathematicae
Algorithm 83. Stepwise selection of discriminative variables by the use of the trace criterion
Anna Bartkowiak (1982)
Applicationes Mathematicae
Algorithme de Bareiss, algorithme des sous-résultants
Lionel Ducos (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum.
Pham Dinh Tao (1984)
Numerische Mathematik
Algorithmes tronques de découpe linéaire
F. Robert (1972)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées.
J. Roman, P. Charrier (1987)
Numerische Mathematik
Algorithms. 42. BISEC. The eigenvalues of the symmetric eigenproblem and related eigenproblems
Lubomír Skála (1977)
Aplikace matematiky
Algorithms 62-64. Graph-theoretic algorithms for sparse matrix transformations
Jadwiga Dzikiewicz, M. M. Sysło (1978)
Applicationes Mathematicae
Algorithms 80-81. Calculation of projections
J. K. Baksalary, A. Dobek, R. Kala (1980)
Applicationes Mathematicae
Algorithms for Confluent Vandermonde Systems.
Tommy Elfving, Ake Björck (1973)
Numerische Mathematik
Algorithms for Lambda-Matrices.
P. LANCASTER (1964)
Numerische Mathematik
Algorithms for the matrix sector function.
Laszkiewicz, Beata, Ziȩtak, Krystyna (2008)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
All-at-once preconditioning in PDE-constrained optimization
Tyrone Rees, Martin Stoll, Andy Wathen (2010)
Kybernetika
The optimization of functions subject to partial differential equations (PDE) plays an important role in many areas of science and industry. In this paper we introduce the basic concepts of PDE-constrained optimization and show how the all-at-once approach will lead to linear systems in saddle point form. We will discuss implementation details and different boundary conditions. We then show how these system can be solved efficiently and discuss methods and preconditioners also in the case when bound...
Alternating direction Galerkin method with capacitance matrix for the parabolic problem with natural boundary condition
M. Dryja (1984)
Banach Center Publications
Alternating Methods for Sets of Linear Equations.
V. Conrad, Y. Wallach (1979)
Numerische Mathematik
Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization.
Han, Lixing, Neumann, Michael, Prasad, Upendra (2009)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Altman's methods revisited
C. Roland, B. Beckermann, C. Brezinski (2004)
Applicationes Mathematicae
We discuss two different methods of Altman for solving systems of linear equations. These methods can be considered as Krylov subspace type methods for solving a projected counterpart of the original system. We discuss the link to classical Krylov subspace methods, and give some theoretical and numerical results on their convergence behavior.