A better triangulation for wright's 2n-ray algorithm

Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review

View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)417-429
Journal / PublicationJournal of Mathematical Analysis and Applications
Volume212
Issue number2
Publication statusPublished - 15 Aug 1997
Externally publishedYes

Link(s)

Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-0031571520&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(5430c09a-0e81-4bc4-948f-bcc74d798dca).html

Abstract

We give a triangulation for Wright's 2n-ray algorithm to compute solutions of nonlinear equations. According to measures of efficiency of triangulations, it is better than any other available triangulation for the 2n-ray algorithm. © 1997 Academic Press.

Fingerprint

Publication fingerprints text

100
Triangulation Engineering & Materials S...
22
Nonlinear equations Engineering & Materials S...
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]

A better triangulation for wright's 2n-ray algorithm. / Dang, Chuangyin; Talman, Dolf.

In: Journal of Mathematical Analysis and Applications, Vol. 212, No. 2, 15.08.1997, p. 417-429.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review