Network


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

Hotspot


Dive into the research topics where Carl D. Meyer is active.

Publication


Featured researches published by Carl D. Meyer.


Archive | 2000

Matrix analysis and applied linear algebra

Carl D. Meyer

Preface 1. Linear equations 2. Rectangular systems and echelon forms 3. Matrix algebra 4. Vector spaces 5. Norms, inner products, and orthogonality 6. Determinants 7. Eigenvalues and Eigenvectors 8. Perron-Frobenius theory of nonnegative matrices Index.


SIAM Journal on Scientific Computing | 1996

A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method

Michele Benzi; Carl D. Meyer; Miroslav Tuma

A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix


Siam Review | 2005

A Survey of Eigenvector Methods for Web Information Retrieval

Amy N. Langville; Carl D. Meyer

A


Siam Review | 1975

The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains

Carl D. Meyer

is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient calculations. It is proved that in exact arithmetic the preconditioner is well defined if


Siam Review | 1989

Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems

Carl D. Meyer

A


Linear Algebra and its Applications | 2001

Comparison of perturbation bounds for the stationary distribution of a Markov chain

Grace E. Cho; Carl D. Meyer

is an H-matrix. The results of numerical experiments are presented.


Siam Journal on Algebraic and Discrete Methods | 1980

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

Carl D. Meyer

Web information retrieval is significantly more challenging than traditional well-controlled, small document collection information retrieval. One main difference between traditional information retrieval and Web information retrieval is the Webs hyperlink structure. This structure has been exploited by several of todays leading Web search engines, particularly Google and Teoma. In this survey paper, we focus on Web information retrieval methods that use eigenvector computations, presenting the three popular methods of HITS, PageRank, and SALSA.


American Mathematical Monthly | 1998

The idea behind Krylov methods

Ilse C. F. Ipsen; Carl D. Meyer

For an m-state homogeneous Markov chain whose one-step transition matrix is T, the group inverse,


Siam Journal on Applied Mathematics | 1977

The Index and the Drazin Inverse of Block Triangular Matrices

Carl D. Meyer; Nicholas J. Rose

A^#


Siam Journal on Applied Mathematics | 1973

Generalized Inversion of Modified Matrices

Carl D. Meyer

, of the matrix

Collaboration


Dive into the Carl D. Meyer's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Stephen L. Campbell

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

Ilse C. F. Ipsen

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

Nicholas J. Rose

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

Shaina Race

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

Anjela Govan

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

C. T. Kelley

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

Grace E. Cho

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar

Hansi Jiang

North Carolina State University

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge