Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Homer F. Walker is active.

Publication


Featured researches published by Homer F. Walker.


Siam Review | 1984

Mixture Densities, Maximum Likelihood and the EM Algorithm

Richard A. Redner; Homer F. Walker

The problem of estimating the parameters which determine a mixture density has been the subject of a large, diverse body of literature spanning nearly ninety years. During the last two decades, the method of maximum likelihood has become the most widely followed approach to this problem, thanks primarily to the advent of high speed electronic computers. Here, we first offer a brief survey of the literature directed toward this problem and review maximum-likelihood estimation for it. We then turn to the subject of ultimate interest, which is a particular iterative procedure for numerically approximating maximum-likelihood estimates for mixture density problems. This procedure, known as the EM algorithm, is a specialization to the mixture density context of a general algorithm of the same name used to approximate maximum-likelihood estimates for incomplete data problems. We discuss the formulation and theoretical and practical properties of the EM algorithm for mixture densities, focussing in particular on ...


Siam Journal on Optimization | 1994

Globally Convergent Inexact Newton Methods

Stanley C. Eisenstat; Homer F. Walker

Inexact Newton methods for finding a zero of


Siam Journal on Scientific and Statistical Computing | 1988

Implementation of the GMRES method using householder transformations

Homer F. Walker

F:\mathbf{R}^n \to \mathbf{R}^n


SIAM Journal on Scientific Computing | 1998

NITSOL: A Newton Iterative Solver for Nonlinear Systems

Michael Pernice; Homer F. Walker

are variations of Newton’s method in which each step only approximately satisfies the linear Newton equation but still reduces the norm of the local linear model of F. Here, inexact Newton methods are formulated that incorporate features designed to improve convergence from arbitrary starting points. For each method, a basic global convergence result is established to the effect that, under reasonable assumptions, if a sequence of iterates has a limit point at which


SIAM Journal on Matrix Analysis and Applications | 1997

GMRES On (Nearly) Singular Systems

Peter N. Brown; Homer F. Walker

F^\prime


ACM Transactions on Mathematical Software | 1997

Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms

Layne T. Watson; Maria Sosonkina; Robert C. Melville; Alexander P. Morgan; Homer F. Walker

is invertible, then that limit point is a solution and the sequence converges to it. When appropriate, it is shown that initial inexact Newton steps are taken near the solution, and so the convergence can ultimately be made as fast as desired, up to the rate of Newton’s method, by forcing the initial linear residuals to be appropriately small. The primary goal is to introduce and analyze new inexact Newton methods, but consideration is also given to “gl...


SIAM Journal on Numerical Analysis | 1981

Convergence Theorems for Least-Change Secant Update Methods,

John E. Dennis; Homer F. Walker

The standard implementation of the GMRES method for solving large nonsymmetric linear systems involves a Gram-Schmidt process which is a potential source of significant numerical error. An alternative implementation is outlined here in which orthogonalization by Householder transformations replaces the Gram-Schmidt process. This implementation requires slightly less storage but somewhat more arithmetic than the standard one; however, numerical experiments suggest that it is more stable, especially as the limits of residual reduction are reached. The extra arithmetic required may be less significant when products of the coefficient matrix with vectors are expensive or on vector and, in particular, parallel machines.


SIAM Journal on Numerical Analysis | 2011

Anderson Acceleration for Fixed-Point Iterations

Homer F. Walker; Peng Ni

We introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems. The framework is an inexact Newton method globalized by backtracking. Trial steps are obtained using one of several Krylov subspace methods. The algorithm is implemented in a Fortran solver called NITSOL that is robust yet easy to use and provides a number of useful options and features. The structure offers the user great flexibility in addressing problem specificity through preconditioning and other means and allows easy adaptation to parallel environments. Features and capabilities are illustrated in numerical experiments.


SIAM Journal on Scientific Computing | 1994

Residual smoothing techniques for iterative methods

Lu Zhou; Homer F. Walker

We consider the behavior of the GMRES method for solving a linear system


Computers & Structures | 2002

Simulating cyclic artery compression using a 3D unsteady model with fluid–structure interactions

Dalin Tang; Chun Yang; Homer F. Walker; Shunichi Kobayashi; David N. Ku

Ax = b

Collaboration


Dive into the Homer F. Walker's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

John N. Shadid

Sandia National Laboratories

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Carol S. Woodward

Lawrence Livermore National Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Chun Yang

Worcester Polytechnic Institute

View shared research outputs
Top Co-Authors

Avatar

Dalin Tang

Worcester Polytechnic Institute

View shared research outputs
Top Co-Authors

Avatar

David N. Ku

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Joseph P. Simonis

Sandia National Laboratories

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge