• Login
    View Item 
    •   Home
    • University Colleges
    • SUNY Plattsburgh
    • Faculty Work
    • Mathematics Faculty Work
    • View Item
    •   Home
    • University Colleges
    • SUNY Plattsburgh
    • Faculty Work
    • Mathematics Faculty Work
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of SUNY Open Access RepositoryCommunitiesPublication DateAuthorsTitlesSubjectsDepartmentThis CollectionPublication DateAuthorsTitlesSubjectsDepartmentAuthor ProfilesView

    My Account

    LoginRegister

    Campus Communities in SOAR

    Alfred State CollegeBrockportBroomeCantonDownstateEmpireFashion Institute of TechnologyFredoniaMaritimeNew PaltzOneontaOptometryOswegoPlattsburghSUNY Polytechnic InstituteSUNY PressUpstate Medical

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    A root-finding algorithm for cubics

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    fulltext.pdf
    Size:
    140.8Kb
    Format:
    PDF
    Description:
    full-text
    Download
    Average rating
     
       votes
    Cast your vote
    You can rate an item by clicking the amount of stars they wish to award to this item. When enough users have cast their vote on this item, the average rating will also be shown.
    Star rating
     
    Your vote was cast
    Thank you for your feedback
    Author
    Northshield, Sam
    Keyword
    Newton's method
    iterative algorithm
    generally convergent
    Date Published
    2013
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/20.500.12648/1113
    Abstract
    Newton's method applied to a quadratic polynomial converges rapidly to a root for almost all starting points and almost all coefficients. This can be understood in terms of an associative binary operation arising from 2 x 2 matrices. Here we develop an analogous theory based on 3 x 3 matrices which yields a two-variable generally convergent algorithm for cubics.
    Citation
    Northshield, S. (2013). A root-finding algorithm for cubics. Proceedings of the American Mathematical Society, 141(2). http://doi.org/10.1090/S0002-9939-2012-11324-3
    Description
    This article has been published in Proceedings of the American Mathematical Society: https://doi.org/10.1090/S0002-9939-2012-11324-3
    Collections
    Mathematics Faculty Work

    entitlement

     

    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.