Numerical stability of the symplectic LLT factorization

StatusVoR
Simple item page
cris.lastimport.scopus2025-12-15T04:13:27Z
dc.abstract.enIn this paper we give the detailed error analysis of two algorithms W1 and W2 for computing the symplectic factorization of a symmetric positive definite and symplectic matrix AeR2n*2n in the form A=LLT , where LeR2n*2n is a symplectic block lower triangular matrix. We prove that Algorithm w2 is numerically stable for a broader class of symmetric positive definite matrices AeR2n*2n . It means that Algorithm W2 is producing the computed factors L in floating-point arithmetic with machine precision u such that A - LLT//2=0(n2u//A//2) . On the other hand, Algorithm W1 is unstable, in general, for symmetric positive definite and symplectic matrix A . In this paper we also give corresponding bounds for Algorithm W1 that are weaker. We show that the factorization error depends on the conditioning of the principal submatrix A11eRnxn, located in the upper-left block of A . Bounds for the loss of symplecticity of the lower block triangular matrices L for both Algorithms W1 and W2 that hold in exact arithmetic for a broader class of symmetric positive definite matrices A (but not necessarily symplectic) are also given. The tests performed in MATLAB illustrate that our error bounds for considered algorithms are reasonably sharp.
dc.affiliationKatedra Informatyki
dc.affiliationWydział Projektowania w Warszawie
dc.contributor.authorBujok, Maksymilian
dc.contributor.authorRozložník, Miroslav
dc.contributor.authorSmoktunowicz, Agata
dc.contributor.authorSmoktunowicz, Alicja
dc.date.access2025-09-18
dc.date.accessioned2025-09-18T11:01:34Z
dc.date.available2025-09-18T11:01:34Z
dc.date.created2025-05-15
dc.date.issued2025-04-22
dc.description.accesstimeat_publication
dc.description.versionfinal_published
dc.identifier.doi10.1007/s11075-025-02075-z
dc.identifier.eissn1572-9265
dc.identifier.issn1017-1398
dc.identifier.urihttps://share.swps.edu.pl/handle/swps/1798
dc.identifier.weblinkhttps://link.springer.com/article/10.1007/s11075-025-02075-z
dc.languageen
dc.pbn.affiliationinformatyka
dc.rightsClosedAccess
dc.rights.explanationzamknięty dostęp
dc.rights.questionNo_rights
dc.share.articleOPEN_REPOSITORY
dc.subject.enL L T factorization
dc.subject.enBackward error analysis
dc.subject.enCondition number
dc.subject.enSymplectic matrix
dc.subject.enCholesky decomposition
dc.swps.sciencecloudnosend
dc.titleNumerical stability of the symplectic LLT factorization
dc.title.journalNumerical Algorithms
dc.typeJournalArticle
dspace.entity.typeArticle