Algorithm 60. Determination of the Jordan canonical form of real matrix
Algorithm 61. The solution of a certain linear equation system
Algorithm 82. Stepwise selection of discriminative variables by the use of the Wilks criterion
Algorithm 83. Stepwise selection of discriminative variables by the use of the trace criterion
Algorithme de Bareiss, algorithme des sous-résultants
Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum.
Algorithmes tronques de découpe linéaire
Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées.
Algorithms. 42. BISEC. The eigenvalues of the symmetric eigenproblem and related eigenproblems
Algorithms 62-64. Graph-theoretic algorithms for sparse matrix transformations
Algorithms 80-81. Calculation of projections
Algorithms for Confluent Vandermonde Systems.
Algorithms for Lambda-Matrices.
Algorithms for the matrix sector function.
All-at-once preconditioning in PDE-constrained optimization
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
Alternating Methods for Sets of Linear Equations.
Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization.
Altman's methods revisited
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.
An Accelerated Bisection Method for the Calculation of Eigenvalues of a Symmetric Tridiagonal Matrix.