O'Leary, Dianne P.Overview
Publication Timeline
Most widely held works by
Dianne P O'Leary
The interface of three areas of computer science with the mathematical sciences summary of a workshop
by Dianne P O'Leary
(
)
3 editions published in 2000 in English and held by 796 WorldCat member libraries worldwide
Milestones in matrix computation selected works of Gene H. Golub, with commentaries
by Gene H Golub
(
)
11 editions published in 2007 in English and held by 790 WorldCat member libraries worldwide The text presents and discusses some of the most influential papers in Matrix Computation authored by Gene H. Golub, one of the founding fathers of the field. Including commentaries by leading experts and a brief biography, this text will be of great interest to students and researchers in numerical analysis and scientific computation.  ;The text presents and discusses some of the most influential papers in Matrix Computation authored by Gene H. Golub, one of the founding fathers of the field. The collection of 21 papers is divided into five main areas: iterative methods for linear systems, s
G.W. Stewart selected works with commentaries
by G. W Stewart
(
)
11 editions published in 2010 in English and held by 393 WorldCat member libraries worldwide
Scientific computing with case studies
by Dianne P O'Leary
(
Book
)
14 editions published between 2008 and 2009 in English and held by 208 WorldCat member libraries worldwide This book is a practical guide to the numerical solution of linear and nonlinear equations, differential equations, optimization problems, and eigenvalue problems. It treats standard problems and introduces important variants such as sparse systems, differentialalgebraic equations, constrained optimization, Monte Carlo simulations, and parametric studies. Stability and error analysis are emphasized, and the Matlab algorithms are grounded in sound principles of software design and understanding of machine arithmetic and memory management. Nineteen case studies provide experience in mathematical modeling and algorithm design, motivated by problems in physics, engineering, epidemiology, chemistry, and biology. The topics included go well beyond the standard firstcourse syllabus, introducing important problems such as differentialalgebraic equations and conic optimization problems, and important solution techniques such as continuation methods. The case studies cover a wide variety of fascinating applications, from modeling the spread of an epidemic to determining truss configurations
The mathematics of information coding, extraction, and distribution
by George Cybenko
(
Book
)
8 editions published in 1999 in English and held by 159 WorldCat member libraries worldwide "High performance computing consumes, and generates vast amounts of data, and the storage, retrieval, and transmission of these data are major obstacles to effective use of computing power, Challenges inherent in all of these operations are security, speed, reliability, authentication, and reproducibility. This workshop focused on a wide variety of technical results aimed at meeting these challenges."Jacket
Deblurring images : matrices, spectra, and filtering
by Per Christian Hansen
(
)
8 editions published in 2006 in English and held by 44 WorldCat member libraries worldwide Describes the deblurring algorithms and techniques collectively known as spectral filtering methods, in which the singular value decomposition, or a similar decomposition with spectral properties, is used to introduce the necessary regularization or filtering in the reconstructed image. The concise MATLAB® implementations described in the book provide a template of techniques that can be used to restore blurred images from many applications
Hybrid conjugate gradient algorithms
by Dianne P O'Leary
(
Book
)
6 editions published in 1976 in English and Undetermined and held by 7 WorldCat member libraries worldwide
Parallel QR factorization by householder and modified GramSchmidt algorithms
by Dianne P O'Leary
(
Book
)
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
Yet another polynomial preconditioner for the conjugate gradient algorithm
by Dianne P O'Leary
(
Book
)
1 edition published in 1990 in English and held by 5 WorldCat member libraries worldwide Abstract: "Polynomial preconditioning is a useful tool in the effective use of the conjugate gradient algorithm on special architectures such as message passing parallel computers, machines with hierarchical memory, vector processors, and machines with very limited memory. In this work we investigate the use of a new adaptive algorithm which uses the polynomial preconditioner based on the residual polynomial from k steps of the conjugate gradient algorithm."
The use of the Lcurve in the regularization of discrete ill posed problems
by Per Christian Hansen
(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide Secondly, we propose a new method for choosing the regularization parameter based on the Lcurve, and show how this method can be implemented efficiently. We compare the method to generalized cross validation and demonstrate that our new method is more robust in the presence of correlated errors."
Constrained matrix Liapunov equations
by Jewel B Barlow
(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide Abstract: "We consider the problem of finding matrices L and T satisfying TA  FT = LC and TB = 0. We establish existence conditions for the solution, derive an algorithm for computing the solution, and discuss conditions under which the matrix [C[superscript T], T[superscript T]] is full rank. The problem arises in control theory, in the design of reduced order observers that achieve loop transfer recovery."
A parallel inexact Newton method using a Krylov multisplitting algorithm
by ChiouMing Huang
(
Book
)
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide Abstract: "We present a parallel variant of the inexact Newton algorithm that uses the Krylov multisplitting algorithm (KMS) to compute the approximate Newton direction. The algorithm can be used for solving unconstrained optimization problems or systems of nonlinear equations. The KMS algorithm is a more efficient parallel implementation of Krylov subspace methods (GMRES, Arnoldi, etc.) with multisplitting preconditioners. The work of the KMS algorithm is divided into the multisplitting tasks and a direction forming task. There is a great deal of parallelism within each task and the number of synchronization points between the tasks is greatly reduced. We study the local and global convergence properties of the algorithm and present results of numerical examples on a sequential computer."
Some history of the conjugate gradient and Lanczos algorithms : 19481976
by Gene H Golub
(
Book
)
1 edition published in 1987 in English and held by 4 WorldCat member libraries worldwide
A block GTH algorithm for finding the stationary vector of a Markov chain
by Dianne P O'Leary
(
Book
)
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide Abstract: "Grassman, Taksar, and Heyman have proposed an algorithm for computing the stationary vector of a Markov chain. Analysis by O'Cinneide confirmed the results of numerical experiments, proving that the GTH algorithm computes an approximation to the stationary vector with low relative error in each component. In this work, we develop a block form of the GTH algorithm, more efficient on high performance architectures, and show that it, too, produces a vector with low relative error. We demonstrate the efficiency of the algorithm on vector processors and on workstations with hierarchical memory."
The design of reducedorder Luenberger observers with precise LTR
by Moghen M Monahemi
(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide Abstract: "This work concerns the design of reducedorder observers for controllable, observable, and regular systems in which the number of measurements is more than the number of controls. It uses eigenstructure assignment whereas other approaches use Kalman filter (LQG/LTR) methods. The advantages of this approach are the following: i) precise LTR rather than approximate LTR, ii) no restriction to minimum phase systems, iii) finite observer gain rather than asymptotic observer gain, iv) simpler and more efficient numerical calculation. Case studies are presented illustrating these features."
What is fundamental for Markov chains : first passage times, fundamental matrices, and group generalized inverses
by Daniel P Heyman
(
Book
)
1 edition published in 1994 in English and held by 4 WorldCat member libraries worldwide Abstract: "In this paper we discuss algorithms for computing the fundamental matrix, the group generalized inverse, and the mean and variance of first passage times for discrete time regular Markov chains. The algorithms are based on the GTH algorithm for computing a stationary vector. We show that although all of these quantities can easily be computed from any one of them, the standard algebraic relations do not produce algorithms that preserve low componentwise relative error in each of them."
Why Broyden's nonsymmetric method terminates on linear equations
by Dianne P O'Leary
(
Book
)
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide Abstract: "The family of algorithms introduced by Broyden in 1965 for solving systems of nonlinear equations has been used quite effectively on a variety of problems. In 1979, Gay proved the then surprising result that the algorithms terminate in at most 2n steps on linear problems with n variables. His very clever proof gives no insight into properties of the intermediate iterates, however. In this work we show that Broyden's methods are projection methods, forcing the residuals to lie in a nested set of subspaces of decreasing dimension."
DOMINO : a message passing environment for parallel computation
by Dianne P O'Leary
(
Book
)
1 edition published in 1986 in English and held by 3 WorldCat member libraries worldwide
Capacitance matrix methods for the Helmholtz equation on general threedimensional regions
by Dianne P O'Leary
(
Book
)
1 edition published in 1978 in English and held by 3 WorldCat member libraries worldwide
Numerical solutions of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
by Paul Concus
(
Book
)
3 editions published between 1976 and 1977 in English and held by 3 WorldCat member libraries worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Algebras, Linear Algorithms Boundary value problems Coding theory Computer network protocols Computer networks Computer scienceMathematics Computer vision Conjugate gradient methods Control theory Data mining Differential equations, Elliptic Differential equations, EllipticNumerical solutions Differential equations, Nonlinear Engineering mathematics Factorization (Mathematics) Golub, Gene H.(Gene Howard), Helmholtz equationNumerical solutions High performance computing Image processingMathematical models Information theory Integral equations Iterative methods (Mathematics) Linear systems Markov processes Mathematical modelsData processing Mathematics Matrices Numerical analysis Parallel processing (Electronic computers) Perturbation (Mathematics) System analysis

Alternative Names
O'Leary, D. P. (Dianne P.)
O'Leary, Dianne
O'Leary, Dianne Prost
Languages
Covers
