default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslav S. Pranic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Hanan Almutairi, Miroslav S. Pranic
, Lothar Reichel:
Error estimates for quadrature rules based on the Arnoldi process. J. Comput. Appl. Math. 442: 115726 (2024)- [j14]Nevena Z. Petrovic, Miroslav S. Pranic, Marija P. Stanic, Tatjana V. Tomovic Mladenovic:
The set of anti-Gaussian quadrature rules for the optimal set of quadrature rules in Borges' sense. J. Comput. Appl. Math. 442: 115733 (2024) - 2023
- [j13]Jihan Alahmadi, Miroslav S. Pranic, Lothar Reichel:
Pole Allocation for Rational Gauss Quadrature Rules for Matrix Functionals Defined by a Stieltjes Function. Axioms 12(2): 105 (2023) - 2022
- [j12]Jihan Alahmadi, Miroslav S. Pranic, Lothar Reichel:
Rational gauss quadrature rules for the approximation of matrix functionals involving stieltjes functions. Numerische Mathematik 151(2): 443-473 (2022) - 2021
- [j11]Jihan Alahmadi, Miroslav S. Pranic, Lothar Reichel:
Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules. J. Comput. Appl. Math. 396: 113604 (2021) - [j10]Stefano Pozza, Miroslav S. Pranic:
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization. Numer. Algorithms 88(2): 647-678 (2021) - [j9]Jihan Alahmadi, Hessah Alqahtani, Miroslav S. Pranic, Lothar Reichel:
Gauss-Laurent-type quadrature rules for the approximation of functionals of a nonsymmetric matrix. Numer. Algorithms 88(4): 1937-1964 (2021)
2010 – 2019
- 2016
- [j8]Miroslav S. Pranic, Lothar Reichel, Giuseppe Rodriguez, Zhengsheng Wang, Xuebo Yu:
A rational Arnoldi process with applications. Numer. Linear Algebra Appl. 23(6): 1007-1022 (2016) - 2015
- [j7]Miroslav S. Pranic, Lothar Reichel:
Generalized anti-Gauss quadrature rules. J. Comput. Appl. Math. 284: 235-243 (2015) - 2014
- [j6]Miroslav S. Pranic, Lothar Reichel:
Rational Gauss Quadrature. SIAM J. Numer. Anal. 52(2): 832-851 (2014) - 2013
- [j5]Miroslav S. Pranic, Lothar Reichel:
Recurrence relations for orthogonal rational functions. Numerische Mathematik 123(4): 629-642 (2013) - 2012
- [j4]Miodrag M. Spalevic, Miroslav S. Pranic, Aleksandar V. Pejcev:
Maximum of the modulus of kernels of Gaussian quadrature formulae for one class of Bernstein-Szegő weight functions. Appl. Math. Comput. 218(9): 5746-5756 (2012) - 2010
- [j3]Miodrag M. Spalevic, Miroslav S. Pranic:
Error bounds of certain Gaussian quadrature formulae. J. Comput. Appl. Math. 234(4): 1049-1057 (2010)
2000 – 2009
- 2009
- [j2]Gradimir V. Milovanovic, Miodrag M. Spalevic, Miroslav S. Pranic:
Error estimates for Gaussian quadratures of analytic functions. J. Comput. Appl. Math. 233(3): 802-807 (2009) - 2008
- [j1]Gradimir V. Milovanovic, Miodrag M. Spalevic, Miroslav S. Pranic:
Maximum of the modulus of kernels in Gauss-Turán quadratures. Math. Comput. 77(262): 985-994 (2008)
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 2024-05-08 21:02 CEST 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:
