High-Performance Damped Traub-Type Iterative Scheme for Nonlinear Problems

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract We present a new family of high-performance schemes for solving non-linear systems. The method is simple and offers a very low computational cost. The convergence analysis shows that the order reaches twice the number of steps. We focus on a new eighth-order method that requires to solve only four linear systems per iteration. These systems share the same Jacobian matrix and a simple scalar weight function. Efficiency studies show that our method outperforms other optimal eighth-order and highly efficient ninth-order schemes in the literature. A dynamical analysis confirms its superior stability, showing large and connected convergence regions. Monte Carlo tests on the Bratu problem prove that the new scheme can exceed the stability of the optimal second-order Newton's method, introducing a new robustness test by using uncertainty vs. non-linearity. High-precision numerical tests on an elastic string problem validate the theoretical results. This work enables the practical use of very high-order schemes with minimal computational effort.
Full text 10,148 characters · extracted from preprint-html · click to expand
High-Performance Damped Traub-Type Iterative Scheme for Nonlinear Problems | 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 High-Performance Damped Traub-Type Iterative Scheme for Nonlinear Problems Alicia Cordero, Renso V. Rojas-Hiciano, Juan R. Torregrosa This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9145523/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 We present a new family of high-performance schemes for solving non-linear systems. The method is simple and offers a very low computational cost. The convergence analysis shows that the order reaches twice the number of steps. We focus on a new eighth-order method that requires to solve only four linear systems per iteration. These systems share the same Jacobian matrix and a simple scalar weight function. Efficiency studies show that our method outperforms other optimal eighth-order and highly efficient ninth-order schemes in the literature. A dynamical analysis confirms its superior stability, showing large and connected convergence regions. Monte Carlo tests on the Bratu problem prove that the new scheme can exceed the stability of the optimal second-order Newton's method, introducing a new robustness test by using uncertainty vs. non-linearity. High-precision numerical tests on an elastic string problem validate the theoretical results. This work enables the practical use of very high-order schemes with minimal computational effort. Systems of non-linear equations Iterative methods Damped Traub-type Vectorial optimal eighth-order Global stability Bratu problem Elastic string problem 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-9145523","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":615533091,"identity":"fd1fbcce-97d5-4642-be0f-99b8264ca34a","order_by":0,"name":"Alicia Cordero","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA0klEQVRIiWNgGAWjYLACHiDmJ12LZAMDYwNpWgwOEKuFv/3wsQ9vKu7JGV87/PwBY9udxAb29gd4tUicSUueOedMsbHZ7TTDBsa2Z4kNPGcM8Ftzg8eYmbctIXHb7QSQlsPGDBI5+HXIg7X8S0jcPDv9I0SL/HP8DjMAa2lISNwgnQO2RY5BggG/wwyBfmGccyzBWOJ2TuGMhHPP5Nh4cvBrkTt++DDDm5oEOf7Z6Rs+fCi7w8PPfhy/w1BBAsMBBjYS1IPBAVI1jIJRMApGwQgAAIlkRgtoTtT/AAAAAElFTkSuQmCC","orcid":"","institution":"Universitat Politècnica de València","correspondingAuthor":true,"prefix":"","firstName":"Alicia","middleName":"","lastName":"Cordero","suffix":""},{"id":615533092,"identity":"bd7abb8e-ab6e-4fda-bbad-073486b455ad","order_by":1,"name":"Renso V. Rojas-Hiciano","email":"","orcid":"","institution":"Mother and Teacher Pontifical Catholic University","correspondingAuthor":false,"prefix":"","firstName":"Renso","middleName":"V.","lastName":"Rojas-Hiciano","suffix":""},{"id":615533093,"identity":"a95a83a7-c99a-4899-8b6d-9c88ec7e42f8","order_by":2,"name":"Juan R. Torregrosa","email":"","orcid":"","institution":"Universitat Politècnica de València","correspondingAuthor":false,"prefix":"","firstName":"Juan","middleName":"R.","lastName":"Torregrosa","suffix":""}],"badges":[],"createdAt":"2026-03-17 08:00:15","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9145523/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9145523/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":109461117,"identity":"295d4035-856a-4883-9a52-33d74c0ead75","added_by":"auto","created_at":"2026-05-18 10:56:01","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":910171,"visible":true,"origin":"","legend":"","description":"","filename":"8SuperTraubsubmit.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9145523/v1_covered_5769afff-5da8-4ecd-a4fb-41729cc8329e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"High-Performance Damped Traub-Type Iterative Scheme for Nonlinear Problems","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":"Systems of non-linear equations, Iterative methods, Damped Traub-type, Vectorial optimal eighth-order, Global stability, Bratu problem, Elastic string problem","lastPublishedDoi":"10.21203/rs.3.rs-9145523/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9145523/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"We present a new family of high-performance schemes for solving non-linear systems. The method is simple and offers a very low computational cost. The convergence analysis shows that the order reaches twice the number of steps. We focus on a new eighth-order method that requires to solve only four linear systems per iteration. These systems share the same Jacobian matrix and a simple scalar weight function. Efficiency studies show that our method outperforms other optimal eighth-order and highly efficient ninth-order schemes in the literature. A dynamical analysis confirms its superior stability, showing large and connected convergence regions. Monte Carlo tests on the Bratu problem prove that the new scheme can exceed the stability of the optimal second-order Newton's method, introducing a new robustness test by using uncertainty vs. non-linearity. High-precision numerical tests on an elastic string problem validate the theoretical results. This work enables the practical use of very high-order schemes with minimal computational effort.","manuscriptTitle":"High-Performance Damped Traub-Type Iterative Scheme for Nonlinear Problems","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-04-06 13:20:00","doi":"10.21203/rs.3.rs-9145523/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":"29e6d84a-36d1-4af9-8640-a2bf0975b9b7","owner":[],"postedDate":"April 6th, 2026","published":true,"recentEditorialEvents":[{"type":"decision","content":"Rejected","date":"2026-05-18T10:42:43+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-05-16T09:36:00+00:00","index":13,"fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-05-07T09:22:54+00:00","index":12,"fulltext":""}],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-05-18T10:55:36+00:00","versionOfRecord":[],"versionCreatedAt":"2026-04-06 13:20:00","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9145523","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9145523","identity":"rs-9145523","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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 (2026) — 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