skip to content
A class of optimal-order zero-finding methods using derivative evaluations Preview this item
ClosePreview this item
Checking...

A class of optimal-order zero-finding methods using derivative evaluations

Author: R P Brent; Carnegie-Mellon University. Computer Science Department.
Publisher: [Pittsburgh] : Dept. of Computer Science, Carnegie-Mellon University, 1975.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: R P Brent; Carnegie-Mellon University. Computer Science Department.
OCLC Number: 1929532
Description: 15 pages ; 28 cm
Responsibility: Richard P. Brent.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/1929532> # A class of optimal-order zero-finding methods using derivative evaluations
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "1929532" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/2737818#Place/pittsburgh> ; # Pittsburgh
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
    schema:about <http://id.worldcat.org/fast/1041273> ; # Numerical analysis
    schema:about <http://dewey.info/class/510.7808/> ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/129093447> ; # Carnegie-Mellon University. Computer Science Department.
    schema:creator <http://viaf.org/viaf/223659213> ; # Richard P. Brent
    schema:datePublished "1975" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/2737818> ;
    schema:inLanguage "en" ;
    schema:name "A class of optimal-order zero-finding methods using derivative evaluations"@en ;
    schema:productID "1929532" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/1929532#PublicationEvent/pittsburgh_dept_of_computer_science_carnegie_mellon_university_1975> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/2737818#Agent/dept_of_computer_science_carnegie_mellon_university> ; # Dept. of Computer Science, Carnegie-Mellon University
    schema:url <http://doi.library.cmu.edu/10.1184/OCLC/1929532> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/1929532> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/2737818#Agent/dept_of_computer_science_carnegie_mellon_university> # Dept. of Computer Science, Carnegie-Mellon University
    a bgn:Agent ;
    schema:name "Dept. of Computer Science, Carnegie-Mellon University" ;
    .

<http://id.worldcat.org/fast/1041273> # Numerical analysis
    a schema:Intangible ;
    schema:name "Numerical analysis"@en ;
    .

<http://viaf.org/viaf/129093447> # Carnegie-Mellon University. Computer Science Department.
    a schema:Organization ;
    schema:name "Carnegie-Mellon University. Computer Science Department." ;
    .

<http://viaf.org/viaf/223659213> # Richard P. Brent
    a schema:Person ;
    schema:familyName "Brent" ;
    schema:givenName "Richard P." ;
    schema:givenName "R. P." ;
    schema:name "Richard P. Brent" ;
    .

<http://www.worldcat.org/title/-/oclc/1929532>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/1929532> ; # A class of optimal-order zero-finding methods using derivative evaluations
    schema:dateModified "2015-04-17" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.