Implementation of a Near-Optimal Complex Root Clustering Algorithm

Imbach, Rémi; Pan, Victor; Yap, Chee

doi:10.1007/978-3-319-96418-8_28

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, May 16 until 2:00 AM ET on Saturday, May 17 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.

+ Advanced Search

Citation Details

Implementation of a Near-Optimal Complex Root Clustering Algorithm

Award ID(s):: 1733834

PAR ID:: 10073466

Author(s) / Creator(s):: Imbach, Rémi; Pan, Victor; Yap, Chee

Date Published:: 2018-01-01

Journal Name:: International Congress on Mathematical Software (ICMS) 2018

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1007/978-3-319-96418-8_28

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this