A bibliography on parallel and vector numerical algorithms

This is a bibliography of numerical methods. It also includes a number of other references on machine architecture, programming language, and other topics of interest to scientific computing. Certain conference proceedings and anthologies which have been published in book form are listed also

Polynomial and rational measure modifications of orthogonal polynomials via infinite-dimensional banded matrix factorizations

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials

Application of a substructuring technique to the problem of crack extension and closure

A substructuring technique, originally developed for the efficient reanalysis of structures, is incorporated into the methodology associated with the plastic analysis of structures. An existing finite-element computer program that accounts for elastic-plastic material behavior under cyclic loading was modified to account for changing kinematic constraint conditions - crack growth and intermittent contact of crack surfaces in two dimensional regions. Application of the analysis is presented for a problem of a centercrack panel to demonstrate the efficiency and accuracy of the technique

Solving large sparse eigenvalue problems on supercomputers

An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed

Eigenvalue extraction in NASTRAN by the tridiagonal reduction (FEER) method: Real eigenvalue analysis

The development of the tridiagonal reduction method and its implementation in NASTRAN are described for real eigenvalue analysis as typified by structural vibration and buckling problems. This method is an automatic matrix reduction scheme whereby the eigensolutions in the neighborhood of a specified point in the eigenspectrum can be accurately extracted from a tridiagonal eigenvalue problem whose order is much lower than that of the full problem. The process is effected without orbitrary lumping of masses or other physical quantities at selected node points and thus avoids one of the basic weaknesses of other techniques

Non-Hermitian engineering of single mode two dimensional laser arrays

A new scheme for building two dimensional laser arrays that operate in the single supermode regime is proposed. This is done by introducing an optical coupling between the laser array and lossy pseudo-isospectral chains of photonic resonators. The spectrum of this discrete reservoir is tailored to suppress all the supermodes of the main array except the fundamental one. This spectral engineering is facilitated by employing the Householder transformation in conjunction with discrete supersymmetry. The proposed scheme is general and can in principle be used in different platforms such as VCSEL arrays and photonic crystal laser arrays

Non-Hermitian engineering of single mode two dimensional laser arrays

A new scheme for building two dimensional laser arrays that operate in the single supermode regime is proposed. This is done by introducing an optical coupling between the laser array and lossy pseudo-isospectral chains of photonic resonators. The spectrum of this discrete reservoir is tailored to suppress all the supermodes of the main array except the fundamental one. This spectral engineering is facilitated by employing the Householder transformation in conjunction with discrete supersymmetry. The proposed scheme is general and can in principle be used in different platforms such as VCSEL arrays and photonic crystal laser arrays

Non-Hermitian engineering of single mode two dimensional laser arrays

A new scheme for building two dimensional laser arrays that operate in the single supermode regime is proposed. This is done by introducing an optical coupling between the laser array and lossy pseudoisospectral chains of photonic resonators. The spectrum of this discrete reservoir is tailored to suppress all the supermodes of the main array except the fundamental one. This spectral engineering is facilitated by employing the Householder transformation in conjunction with discrete supersymmetry. The proposed scheme is general and can in principle be used in different platforms such as VCSEL arrays and photonic crystal laser arrays