User:Christopher G. Baker: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Christopher G. Baker
No edit summary
No edit summary
 
(6 intermediate revisions by 2 users not shown)
Line 1: Line 1:
My name is Christopher G. Baker. I am a Ph.D. candidate in Computer Science at Florida State University. I am currently participating in an internship at Sandia National Laboratories in Albuquerque, NM, while I complete my dissertation.  
{{AccountNotLive}}
Christopher G. Baker was born in 1979 in Marianna, FL. He is a Ph.D. candidate in Computational Science at [http://www.fsu.edu Florida State University]. He is currently participating in an internship at [http://www.sandia.gov Sandia National Laboratories] in Albuquerque, NM, while working on his doctoral dissertation.  


My work at Sandia is on high-performance, robust parallel algorithms in the [http://software.sandia.gov/trilinos Trilinos project]. Trilinos is a collection of large-scale solvers: linear systems, eigenvalue problems, non-linear optimization. My principal work is on Anasazi, the block eigensolvers package.
His work at Sandia concerns high-performance, robust parallel algorithms in the [http://software.sandia.gov/trilinos Trilinos project]. Trilinos is a collection of large-scale solvers important in scientific computing (e.g., linear systems, eigenvalue problems, non-linear optimization). Baker's principal work is on Anasazi, the block eigensolvers package.


My master's thesis was entitled "A Block Incremental Algorithm For Computing Dominant Singular Subspaces." In this work, I described and analyzed a family of methods for incrementally computing low-rank approximations of a matrix, based on the truncated SVD. This should be contrasted with the common technique of computing the full SVD of a matrix (either incrementally or as a batch) and truncating the unwanted part of the factorization.
His master's thesis was entitled "A Block Incremental Algorithm For Computing Dominant Singular Subspaces". This work described and analyzed a family of methods for incrementally computing low-rank approximations of a matrix, based on the truncated SVD. His dissertation concerns the optimization of smooth function defined on Riemannian manifolds. It focuses on the class of retraction-based optimization methods, particularly the Riemannian trust-region methods.  


My dissertation concerns optimization on Riemannian manifolds. More specifically, I am interested in the class of retraction-based optimization methods, particularly the Riemannian trust-region methods. Feel free to visit [http://www.scs.fsu.edu/~cbaker my home page] for more information on this topic, as well as links to publications.
Please see [http://www.scs.fsu.edu/~cbaker his home page] for more information, including a full curriculum vitae.
 
--[[User:Christopher G. Baker|Christopher G. Baker]] 10:32, 17 May 2007 (MDT)
 
[[Category:CZ Authors|Baker, Christopher G.]]

Latest revision as of 02:36, 22 November 2023


The account of this former contributor was not re-activated after the server upgrade of March 2022.


Christopher G. Baker was born in 1979 in Marianna, FL. He is a Ph.D. candidate in Computational Science at Florida State University. He is currently participating in an internship at Sandia National Laboratories in Albuquerque, NM, while working on his doctoral dissertation.

His work at Sandia concerns high-performance, robust parallel algorithms in the Trilinos project. Trilinos is a collection of large-scale solvers important in scientific computing (e.g., linear systems, eigenvalue problems, non-linear optimization). Baker's principal work is on Anasazi, the block eigensolvers package.

His master's thesis was entitled "A Block Incremental Algorithm For Computing Dominant Singular Subspaces". This work described and analyzed a family of methods for incrementally computing low-rank approximations of a matrix, based on the truncated SVD. His dissertation concerns the optimization of smooth function defined on Riemannian manifolds. It focuses on the class of retraction-based optimization methods, particularly the Riemannian trust-region methods.

Please see his home page for more information, including a full curriculum vitae.

--Christopher G. Baker 10:32, 17 May 2007 (MDT)