A Blended Root-Finding Algorithm for Solving Transcendental Equations

preprint OA: closed
Full text JSON View at publisher

Abstract

This paper focus on a new blended root-finding algorithm to solve the given transcendental equations. This algorithm is based on the classical methods, namely Newton-Raphson method and trisection method. One of the advantages of the proposed algorithm is not only fast converging but also guarantee the root. The proposed algorithm is easy to understand and one can implement this algorithm in any mathematical software tools. Several numerical examples are presented to illustrate the algorithm and comparisons are made to show the efficiency of the proposed algorithm. 2010 AMS classifications: 65N30
Full text 8,358 characters · extracted from preprint-html · click to expand
A Blended Root-Finding Algorithm for Solving Transcendental Equations | 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 Blended Root-Finding Algorithm for Solving Transcendental Equations Srinivasarao Thota This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-2956091/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 This paper focus on a new blended root-finding algorithm to solve the given transcendental equations. This algorithm is based on the classical methods, namely Newton-Raphson method and trisection method. One of the advantages of the proposed algorithm is not only fast converging but also guarantee the root. The proposed algorithm is easy to understand and one can implement this algorithm in any mathematical software tools. Several numerical examples are presented to illustrate the algorithm and comparisons are made to show the efficiency of the proposed algorithm. 2010 AMS classifications: 65N30 Root-finding algorithms Newton-Raphson method Trisection method Hy- brid algorithms Transcendental equations 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-2956091","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":202901766,"identity":"8c0f43a2-b1ee-40d7-b557-b32d18f2ae0a","order_by":0,"name":"Srinivasarao Thota","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABGUlEQVRIiWNgGAWjYLCCBAYJGNMGShsgkWiAB01LGkyLAX4tSOAwjIFbiz0D+7MPD3dYJPb3H3724UfFeXmDA8xPN1cU/JFnYG/eJoFFCw8Dj/GMxDMSiTNupBnP7Dlz23DDATazm2cMDAwbeI6V4dDCzJDYJmHMcIPBmIG37TbjzAYGs5sNBgaMDRI5Zti1sD8Ga5E/f/wz49+2c/YzG9i/gbTYN8i/waEFaDhQi5zBgRxjZt62A4n9DDxgWxIbJHiwaznAA9FieCOnmFnmTHJyPzNPGVCLcXIbT1qxBRYt7A3sjxl/ttXxyJ0/vpnxTYWdbRt7+7abDX/kbPvZD2+8gS2U5R+gizBDaTZsykfBKBgFo2AUEAUAKMlZ/nveb3cAAAAASUVORK5CYII=","orcid":"","institution":"Amrita Vishwa Vidyapeetham University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Srinivasarao","middleName":"","lastName":"Thota","suffix":""}],"badges":[],"createdAt":"2023-05-19 10:30:54","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-2956091/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-2956091/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":51058814,"identity":"9efd9215-1e1d-497d-ad7c-d49cfea6318b","added_by":"auto","created_at":"2024-02-13 12:37:42","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":252624,"visible":true,"origin":"","legend":"","description":"","filename":"PaperAmrita2301.pdf","url":"https://assets-eu.researchsquare.com/files/rs-2956091/v1_covered_50e5494b-9f55-476f-a922-5d82fbf61be4.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Blended Root-Finding Algorithm for Solving Transcendental Equations","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":"Root-finding algorithms, Newton-Raphson method, Trisection method, Hy- brid algorithms, Transcendental equations","lastPublishedDoi":"10.21203/rs.3.rs-2956091/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-2956091/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis paper focus on a new blended root-finding algorithm to solve the given transcendental equations. This algorithm is based on the classical methods, namely Newton-Raphson method and trisection method. One of the advantages of the proposed algorithm is not only fast converging but also guarantee the root. The proposed algorithm is easy to understand and one can implement this algorithm in any mathematical software tools. Several numerical examples are presented to illustrate the algorithm and comparisons are made to show the efficiency of the proposed algorithm.\u003c/p\u003e\n\u003cp\u003e2010 AMS classifications: 65N30\u003c/p\u003e","manuscriptTitle":"A Blended Root-Finding Algorithm for Solving Transcendental Equations","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-05-24 04:36:57","doi":"10.21203/rs.3.rs-2956091/v1","editorialEvents":[{"type":"communityComments","content":4}],"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":"de6c6b08-9b42-4629-9008-2235564b1df5","owner":[],"postedDate":"May 24th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-02-13T12:29:34+00:00","versionOfRecord":[],"versionCreatedAt":"2023-05-24 04:36:57","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-2956091","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-2956091","identity":"rs-2956091","version":["v1"]},"buildId":"7rjqhiLT3MXkJMwkYKINL","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. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00