On the problem of starting points for iterative methods

Stefan Maruster; Laura Maruster

doi:10.1007/s11075-018-0589-9

On the problem of starting points for iterative methods

Stefan Maruster, Laura Maruster^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

146 Downloads (Pure)

Abstract

We propose an algorithm to find a starting point for iterative methods. Numerical experiments show empirically that the algorithm provides starting points for different iterative methods (like Newton method and its variants) with low computational cost.

Original language	English
Pages (from-to)	1149-1155
Number of pages	7
Journal	Numerical algorithms
Volume	81
Issue number	3
DOIs	https://doi.org/10.1007/s11075-018-0589-9
Publication status	Published - Jul-2019

Keywords

Iterative methods
Starting point
Numerical experiments

Access to Document

10.1007/s11075-018-0589-9Licence: CC BY

On the problem of starting points for iterative methodsFinal publisher's version, 594 KBLicence: CC BY

Handle.net

Persistent link

Cite this

@article{70a4e3bb492f49b0b5d3923423d29509,

title = "On the problem of starting points for iterative methods",

abstract = "We propose an algorithm to find a starting point for iterative methods. Numerical experiments show empirically that the algorithm provides starting points for different iterative methods (like Newton method and its variants) with low computational cost.",

keywords = "Iterative methods, Starting point, Numerical experiments",

author = "Stefan Maruster and Laura Maruster",

year = "2019",

month = jul,

doi = "10.1007/s11075-018-0589-9",

language = "English",

volume = "81",

pages = "1149--1155",

journal = "Numerical algorithms",

issn = "1017-1398",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - On the problem of starting points for iterative methods

AU - Maruster, Stefan

AU - Maruster, Laura

PY - 2019/7

Y1 - 2019/7

N2 - We propose an algorithm to find a starting point for iterative methods. Numerical experiments show empirically that the algorithm provides starting points for different iterative methods (like Newton method and its variants) with low computational cost.

AB - We propose an algorithm to find a starting point for iterative methods. Numerical experiments show empirically that the algorithm provides starting points for different iterative methods (like Newton method and its variants) with low computational cost.

KW - Iterative methods

KW - Starting point

KW - Numerical experiments

U2 - 10.1007/s11075-018-0589-9

DO - 10.1007/s11075-018-0589-9

M3 - Article

SN - 1017-1398

VL - 81

SP - 1149

EP - 1155

JO - Numerical algorithms

JF - Numerical algorithms

IS - 3

ER -

On the problem of starting points for iterative methods

Abstract

Keywords

Access to Document

Handle.net

Fingerprint

Cite this