default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert S. Anderssen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j20]R. J. Loy, Robert S. Anderssen:
Lp approximation of completely monotone functions. J. Approx. Theory 248 (2019)- 2016
- [j19]Mark A. Lukas, Frank R. de Hoog, Robert S. Anderssen:
Practical use of robust GCV and modified GCV for spline smoothing. Comput. Stat. 31(1): 269-289 (2016) - 2015
- [j18]Maureen P. Edwards, Robert S. Anderssen:
Symmetries and solutions of the non-autonomous von Bertalanffy equation. Commun. Nonlinear Sci. Numer. Simul. 22(Issues): 1062-1067 (2015) - 2014
- [j17]R. J. Loy, Robert S. Anderssen:
On the construction of Dirichlet series approximations for completely monotone functions. Math. Comput. 83(286): 835-846 (2014) - [j16]R. J. Loy, Robert S. Anderssen:
Interconversion Relationships for Completely Monotone Functions. SIAM J. Math. Anal. 46(3): 2008-2032 (2014) - 2012
- [j15]Frank R. de Hoog, Robert S. Anderssen:
Kernel perturbations for a class of second-kind convolution Volterra equations with non-negative kernels. Appl. Math. Lett. 25(9): 1222-1225 (2012) - 2011
- [j14]Robert S. Anderssen, A. R. Davies, Frank R. de Hoog:
The effect of kernel perturbations when solving the interconversion convolution equation of linear viscoelasticity. Appl. Math. Lett. 24(1): 71-75 (2011) - [j13]Markus Hegland
, Robert S. Anderssen:
Dilational interpolatory inequalities. Math. Comput. 80(274): 1019-1036 (2011) - [j12]Frank R. de Hoog, Robert S. Anderssen, Mark A. Lukas:
Differentiation of matrix functionals using triangular factorization. Math. Comput. 80(275): 1585-1600 (2011) - 2010
- [j11]Mark A. Lukas, Frank R. de Hoog, Robert S. Anderssen:
Efficient algorithms for robust generalized cross-validation spline smoothing. J. Comput. Appl. Math. 235(1): 102-107 (2010) - 2004
- [j10]Robert S. Anderssen, Y. Wu, R. Dolferus, I. Saunders:
An a posteriori strategy for enhancing gene discovery in anonymous cDNA microarray experiments. Bioinform. 20(11): 1721-1727 (2004) - 1999
- [j9]Robert S. Anderssen, Markus Hegland:
For numerical differentiation, dimensionality can be a blessing! Math. Comput. 68(227): 1121-1141 (1999) - 1998
- [j8]Ivan G. Götz, Karl-Heinz Hoffmann, Robert S. Anderssen:
The Global Behavior of Elastoplastic and Viscoelastic Materials with Hysteresis-Type State Equations. SIAM J. Appl. Math. 58(2): 703-723 (1998) - 1997
- [j7]M. Thamban Nair, Markus Hegland, Robert S. Anderssen:
The trade-off between regularity and stability in Tikhonov regularization. Math. Comput. 66(217): 193-206 (1997) - [j6]S. Yu, Geoff A. Latham, Robert S. Anderssen:
Matrix Analysis of a Two-Stage-Splitting Iteration for Maximum Penalized Likelihood Estimation. SIAM J. Matrix Anal. Appl. 18(2): 348-359 (1997) - 1984
- [j5]Robert S. Anderssen, Frank R. de Hoog:
Finite difference methods for the numerical differentiation of non-exact data. Computing 33(3-4): 259-267 (1984) - 1981
- [j4]John W. Paine, Frank R. de Hoog, Robert S. Anderssen:
On the correction of finite difference eigenvalue approximations for Sturm-Liouville problems. Computing 26(2): 123-139 (1981) - 1975
- [j3]Robert S. Anderssen, Anthony J. Guttmann:
A Rationale for the Numerical Differentiation of Experimental Data. Inf. Process. Lett. 4(2): 48-50 (1975) - 1972
- [j2]Robert S. Anderssen:
A Refinement Procedure for Pure Random Search. Inf. Process. Lett. 1(5): 197-200 (1972) - 1968
- [j1]Robert S. Anderssen:
On the Reliability of Finite Difference Representations. Aust. Comput. J. 1(3): 173-177 (1968)
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-04-24 23:04 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:
