Parallel Tools for Solving Incremental Dense Least Squares Problems: Application to Space Geodesy

  • Baboulin A
  • Giraud L
  • Gratton S
  • et al.
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We present a parallel distributed solver that enables us to solve incremental dense least squares arising in some parameter estimation problems. This solver is based on ScaLAPACK [8] and PBLAS [9] kernel routines. In the incremental process, the observations are collected periodically and the solver updates the solution with new observations using a QR factorization algorithm. It uses a recently defined distributed packed format [3] that handles symmetric or triangular matrices in ScaLAPACK-based implementations. We provide performance analysis on IBM pSeries 690. We also present an example of application in the area of space geodesy for gravity field computations with some experimental results.

Cite

CITATION STYLE

APA

Baboulin, A., Giraud, L., Gratton, S., & Langou, J. (2009). Parallel Tools for Solving Incremental Dense Least Squares Problems: Application to Space Geodesy. Journal of Algorithms & Computational Technology, 3(1), 117–133. https://doi.org/10.1260/174830109787186541

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free