Results 1 
7 of
7
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 542 (26 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illustrate these principles using current architectures and software systems, and by showing how one would implement matrix multiplication. Then, we present direct and iterative algorithms for solving linear systems of equations, linear least squares problems, the symmetric eigenvalue problem, the nonsymmetric eigenvalue problem, and the singular value decomposition. We consider dense, band and sparse matrices.
Continuation and Path Following
, 1992
"... CONTENTS 1 Introduction 1 2 The Basics of PredictorCorrector Path Following 3 3 Aspects of Implementations 7 4 Applications 15 5 PiecewiseLinear Methods 34 6 Complexity 41 7 Available Software 44 References 48 1. Introduction Continuation, embedding or homotopy methods have long served as useful ..."
Abstract

Cited by 69 (6 self)
 Add to MetaCart
CONTENTS 1 Introduction 1 2 The Basics of PredictorCorrector Path Following 3 3 Aspects of Implementations 7 4 Applications 15 5 PiecewiseLinear Methods 34 6 Complexity 41 7 Available Software 44 References 48 1. Introduction Continuation, embedding or homotopy methods have long served as useful theoretical tools in modern mathematics. Their use can be traced back at least to such venerated works as those of Poincar'e (18811886), Klein (1882 1883) and Bernstein (1910). Leray and Schauder (1934) refined the tool and presented it as a global result in topology, viz., the homotopy invariance of degree. The use of deformations to solve nonlinear systems of equations Partially supported by the National Science Foundation via grant # DMS9104058 y Preprint, Colorado State University, August 2 E. Allgower and K. Georg may be traced back at least to Lahaye (1934). The classical embedding methods were the
Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part I
, 1993
"... The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve effectively on massively parallel machines. Rather than trying to design a "black box" eigenroutine in the spirit of EISPACK or LAPACK, we propose building a toolbox for this problem. The tools ar ..."
Abstract

Cited by 63 (13 self)
 Add to MetaCart
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve effectively on massively parallel machines. Rather than trying to design a "black box" eigenroutine in the spirit of EISPACK or LAPACK, we propose building a toolbox for this problem. The tools are meant to be used in different combinations on different problems and architectures. In this paper, we will describe these tools which include basic block matrix computations, the matrix sign function, 2dimensional bisection, and spectral divide and conquer using the matrix sign function to find selected eigenvalues. We also outline how we deal with illconditioning and potential instability. Numerical examples are included. A future paper will discuss error analysis in detail and extensions to the generalized eigenproblem.
A list of matrix flows with applications
 in Hamiltonian and Gradients Flows, Algorithms and Control
, 1994
"... Many mathematical problems, such as existence questions, are studied by using an appropriate realization process, either iteratively or continuously. This article is a collection of di erential equations that have been proposed as special continuous realization processes. In some cases, there are re ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Many mathematical problems, such as existence questions, are studied by using an appropriate realization process, either iteratively or continuously. This article is a collection of di erential equations that have been proposed as special continuous realization processes. In some cases, there are remarkable connections betweensmooth ows and discrete numerical algorithms. In other cases, the ow approach seems advantageous in tackling very di cult problems. The ow approach has potential applications ranging from new development ofnumerical algorithms to the theoretical solution of open problems. Various aspects of the recent development and applications of the ow approach are reviewed in this article. 1
Trading off Parallelism and Numerical Stability
, 1992
"... The fastest parallel algorithm for a problem may be significantly less stable numerically than the fastest serial algorithm. We illustrate this phenomenon by a series of examples drawn from numerical linear algebra. We also show how some of these instabilities may be mitigated by better floating poi ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
The fastest parallel algorithm for a problem may be significantly less stable numerically than the fastest serial algorithm. We illustrate this phenomenon by a series of examples drawn from numerical linear algebra. We also show how some of these instabilities may be mitigated by better floating point arithmetic.
Matrix Differential Equations: A Continuous Realization Process for Linear Algebra Problems
, 1992
"... Many mathematical problems, such as existence questions, are studied by using an appropriate realization process, either iteratively or continuously. In this article differential equation techniques are used as a special continuous realization process for linear algebra problems. The matrix differen ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Many mathematical problems, such as existence questions, are studied by using an appropriate realization process, either iteratively or continuously. In this article differential equation techniques are used as a special continuous realization process for linear algebra problems. The matrix differential equations are cast in fairly general frameworks of which special cases have been found to be closely related to important numerical algorithms. The main thrust is to study the dynamics of various isospectral flows. This approach has potential applications ranging from new developmentofnumerical algorithms to theoretical solution of open problems. Various aspects of the recent development and application in this direction are reviewed in this article.
On the Homotopy Method for Symmetric Modified Generalized Eigenvalue Problems
, 1996
"... Large sparse generalized eigenvalue problem plays a significant role in many application areas. Usually only a few smallest eigenpairs (i.e., eigenvalues and their corresponding eigenvectors) are desired in these applications. A frequently encountered problem is to solve a system slightly modified f ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Large sparse generalized eigenvalue problem plays a significant role in many application areas. Usually only a few smallest eigenpairs (i.e., eigenvalues and their corresponding eigenvectors) are desired in these applications. A frequently encountered problem is to solve a system slightly modified from the original system. If the modification is small, the new system can be solved by using Rayleigh Quotient Iteration (RQI); the initial Ritz vectors are provided by the eigenvectors from the original system. However, if the modification is relatively large, direct use of RQI is not sufficient and, in many cases, gives inaccurate results, such as missing some of the eigenvalues. The homotopy method can be used to remedy this problem. In this paper, we review the homotopy method and its theoretical background. The approach employed here is based on perturbation theory which is particularly suitable for practical analysis of the method. Based on this approach, we give some criteria for vari...