default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Maruster
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j13]Stefan Maruster, Laura Maruster
:
On the problem of starting points for iterative methods. Numer. Algorithms 81(3): 1149-1155 (2019)- 2018
- [j12]Ioannis K. Argyros, Stefan Maruster:
Predetermining the number of periodic steps in multi-step Newton-like methods for solving equations and systems of equations. Appl. Math. Comput. 329: 420-431 (2018) - 2017
- [j11]Stefan Maruster:
Estimating the Local Radius of Convergence for Picard Iteration. Algorithms 10(1): 10 (2017) - [j10]Stefan Maruster:
Thresholds of the Inner Steps in Multi-Step Newton Method. Algorithms 10(3): 75 (2017) - [j9]Stefan Maruster, Laura Maruster:
Local convergence of generalized Mann iteration. Numer. Algorithms 76(4): 905-916 (2017) - 2015
- [j8]Ioan Bistran, Stefan Maruster, Liviu Octavian Mafteiu-Scai:
Parallel Variants of Broyden's Method. Algorithms 8(3): 774-785 (2015) - [j7]Laura Maruster, Stefan Maruster:
On the error estimation and T-stability of the Mann iteration. J. Comput. Appl. Math. 276: 110-116 (2015) - 2012
- [c3]Stefan Maruster, Viorel Negru, Liviu Octavian Mafteiu-Scai:
Experimental Study on Parallel Methods for Solving Systems of Equations. SYNASC 2012: 103-107 - 2011
- [j6]Paul-Emile Maingé, Stefan Maruster:
Convergence in norm of modified Krasnoselski-Mann iterations for fixed points of demicontractive mappings. Appl. Math. Comput. 217(24): 9864-9874 (2011) - [j5]Yonghong Yao, Stefan Maruster:
Strong convergence of an iterative algorithm for variational inequalities in Banach spaces. Math. Comput. Model. 54(1-2): 325-329 (2011) - [j4]Laura Maruster, Stefan Maruster:
Strong convergence of the Mann iteration for α-demicontractive mappings. Math. Comput. Model. 54(9-10): 2486-2492 (2011) - [c2]Octavian Cira, Stefan Maruster:
Optimal Inequality Factor for Ehrlich-Aberth's Method. SYNASC 2011: 63-70 - 2010
- [j3]Charles E. Chidume, Stefan Maruster:
Iterative methods for the computation of fixed points of demicontractive mappings. J. Comput. Appl. Math. 234(3): 861-882 (2010)
2000 – 2009
- 2009
- [i1]Laura Maruster, Stefan Maruster:
On the Convex Feasibility Problem. CoRR abs/0905.4909 (2009) - 2007
- [c1]Stefan Maruster, Cristina Popirlan:
Strong Convergence of the Projection Method in Convex Feasibility Problem. SYNASC 2007: 376-380 - 2005
- [j2]Stefan Maruster:
Quasi-nonexpansivity and the Convex Feasibility Problem. Sci. Ann. Cuza Univ. 15: 47-56 (2005) - 2001
- [j1]Stefan Maruster:
The stability of gradient-like methods. Appl. Math. Comput. 117(1): 103-115 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
