A low-rank algorithm for computing Lyapunov operator phi-functions within matrix-valued exponential integrators

preprint OA: closed
Full text JSON View at publisher
AI-generated deep summary by claude@2026-07, 2026-07-04 · read from full text

The paper studies computation of low-rank approximations to large-scale Lyapunov operator φ-functions needed for matrix-valued exponential integrators that target stiff matrix differential equations with low-rank approximate solutions. The authors develop a scaling and recursive procedure and use a quasi-backward error analysis to select optimal algorithm parameters, with computational cost mainly from sparse-matrix times block-vector products. Numerical experiments are presented to confirm the approach as a foundational tool for large-scale differential Lyapunov equations and Riccati equations, while the main caveat stated is that the method’s performance and cost are tied to the sparse-matrix/block-vector operations and tuning via the error analysis. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract In this work we introduce a low-rank algorithm designed to compute low-rank approximations of large-scale Lyapunov operator φ-functions. These computations are crucial for the implementation of matrix-valued exponential integrators tailored for large-scale stiff matrix differential equations, where the (approximate) solutions are of low rank. The method is developed using a scaling and recursive procedure, supplemented by a quasi-backward error analysis to determine the optimal parameters. The computational cost of the method primarily arises from the products of sparse matrix and block vectors.Numerical experiments confirm the effectiveness of the proposed method as a foundational tool for matrix-valued exponential integrators in addressing large-scale differential Lyapunov equations and Riccati equations. MSC Classification: 65L05 , 65F10 , 65F30
Full text 9,407 characters · extracted from preprint-html · click to expand
A low-rank algorithm for computing Lyapunov operator phi-functions within matrix-valued exponential integrators | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A low-rank algorithm for computing Lyapunov operator phi-functions within matrix-valued exponential integrators Dongping Li, Xiuying Zhang, Hongjiong Tian This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4294394/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract In this work we introduce a low-rank algorithm designed to compute low-rank approximations of large-scale Lyapunov operator φ-functions. These computations are crucial for the implementation of matrix-valued exponential integrators tailored for large-scale stiff matrix differential equations, where the (approximate) solutions are of low rank. The method is developed using a scaling and recursive procedure, supplemented by a quasi-backward error analysis to determine the optimal parameters. The computational cost of the method primarily arises from the products of sparse matrix and block vectors.Numerical experiments confirm the effectiveness of the proposed method as a foundational tool for matrix-valued exponential integrators in addressing large-scale differential Lyapunov equations and Riccati equations. MSC Classification: 65L05 , 65F10 , 65F30 Low-rank approximation φ-functions Lyapunov operator Matrix-valued exponential integrators Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4294394","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":305048297,"identity":"e3a9104b-b339-48af-8609-7cdd9eb7fad8","order_by":0,"name":"Dongping Li","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAwElEQVRIiWNgGAWjYBACPmYGA4YPQAZ7A5DgIUYLG1AL4wyQ6gNEa2FgMGDmIU0LO/O2xzY1dvY8EgmMD962McibE3YYW7lxzrHkxB6JBGbDuW0MhjsbCGrhMZPObTiQYC+RwCbN28aQYHCAGC2WDQdADmP/TbwWxoYDjECHsTETqYWt3LAH5Beeh82Sc85JGG4gpIWf//C2Bz9AIcaefPDDmzIbeYK2MICjBgwYG4CEBGH1SFpGwSgYBaNgFOAAALTxMj8pNTiuAAAAAElFTkSuQmCC","orcid":"","institution":"Changchun Normal University","correspondingAuthor":true,"prefix":"","firstName":"Dongping","middleName":"","lastName":"Li","suffix":""},{"id":305048298,"identity":"c804fe5e-e413-4e1b-91d7-9fd9f91e201f","order_by":1,"name":"Xiuying Zhang","email":"","orcid":"","institution":"Changchun Normal University","correspondingAuthor":false,"prefix":"","firstName":"Xiuying","middleName":"","lastName":"Zhang","suffix":""},{"id":305048299,"identity":"600ff9a8-5976-4706-8821-16cf5ceaa99f","order_by":2,"name":"Hongjiong Tian","email":"","orcid":"","institution":"Shanghai Normal University","correspondingAuthor":false,"prefix":"","firstName":"Hongjiong","middleName":"","lastName":"Tian","suffix":""}],"badges":[],"createdAt":"2024-04-19 16:52:46","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4294394/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4294394/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":57899493,"identity":"9098331c-c035-4ec9-872f-9d93e8bf5c19","added_by":"auto","created_at":"2024-06-07 08:29:35","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":398748,"visible":true,"origin":"","legend":"","description":"","filename":"Paper.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4294394/v1_covered_b8c0ec89-a785-4851-b7ed-69badfeb1b62.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A low-rank algorithm for computing Lyapunov operator phi-functions within matrix-valued exponential integrators","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Low-rank approximation, φ-functions, Lyapunov operator, Matrix-valued exponential integrators","lastPublishedDoi":"10.21203/rs.3.rs-4294394/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4294394/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn this work we introduce a low-rank algorithm designed to compute low-rank approximations of large-scale Lyapunov operator φ-functions. These computations are crucial for the implementation of matrix-valued exponential integrators tailored for large-scale stiff matrix differential equations, where the (approximate) solutions are of low rank. The method is developed using a scaling and recursive procedure, supplemented by a quasi-backward error analysis to determine the optimal parameters. The computational cost of the method primarily arises from the products of sparse matrix and block vectors.Numerical experiments confirm the effectiveness of the proposed method as a foundational tool for matrix-valued exponential integrators in addressing large-scale differential Lyapunov equations and Riccati equations.\u003c/p\u003e\n\u003cp\u003eMSC Classification: 65L05 , 65F10 , 65F30\u003c/p\u003e","manuscriptTitle":"A low-rank algorithm for computing Lyapunov operator phi-functions within matrix-valued exponential integrators","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-05-22 20:02:02","doi":"10.21203/rs.3.rs-4294394/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"f9e244f2-e7a2-4dba-bc44-c4cdd4903604","owner":[],"postedDate":"May 22nd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-06-07T08:21:28+00:00","versionOfRecord":[],"versionCreatedAt":"2024-05-22 20:02:02","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4294394","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4294394","identity":"rs-4294394","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00