default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergei G. Solodky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Evgeniya V. Semenova
, Sergiy G. Solodky:
An Optimal Method for High-Order Mixed Derivatives of Bivariate Functions. Comput. Methods Appl. Math. 24(4): 967-982 (2024)- [j10]Sergei G. Solodky, Serhii A. Stasyuk:
The minimal radius of Galerkin information for the problem of numerical differentiation. J. Complex. 81: 101787 (2024) - [i4]Y. V. Semenova, Sergei G. Solodky:
About truncated Chebyshev spectral method for solving numerical differentiation and summation. CoRR abs/2405.20020 (2024) - [i3]Y. V. Semenova, Sergei G. Solodky:
An optimal method for high order mixed derivatives of bivariate functions. CoRR abs/2407.03327 (2024) - 2023
- [i2]Y. V. Semenova, Sergei G. Solodky:
On optimal recovering high order partial derivatives of bivariate functions. CoRR abs/2309.05425 (2023) - [i1]Y. V. Semenova, Sergei G. Solodky:
About optimization of methods for mixed derivatives of bivariate functions. CoRR abs/2309.09710 (2023) - 2022
- [j9]Evgeniya V. Semenova, Sergiy G. Solodky, Serhii A. Stasyuk:
Application of Fourier Truncation Method to Numerical Differentiation for Bivariate Functions. Comput. Methods Appl. Math. 22(2): 477-491 (2022) - 2020
- [j8]Sergei V. Pereverzev, Sergei G. Solodky, Vitalii B. Vasylyk, Mark Zic:
Regularized Collocation in Distribution of Diffusion Times Applied to Electrochemical Impedance Spectroscopy. Comput. Methods Appl. Math. 20(3): 517-530 (2020) - [j7]Sergei G. Solodky, Serhii A. Stasyuk:
Estimates of efficiency for two methods of stable numerical summation of smooth functions. J. Complex. 56 (2020)
2010 – 2019
- 2017
- [j6]Sergei G. Solodky, Ganna L. Myleiko, Evgeniya V. Semenova:
Complexity estimates for severely ill-posed Problems under a posteriori Selection of Regularization parameter. Math. Model. Anal. 22(3): 283-299 (2017)
2000 – 2009
- 2009
- [j5]Sergei G. Solodky, Ganna Mosentsova:
Unsaturable methods for solving severely ill-posed problems. Int. J. Comput. Sci. Math. 2(3): 229-242 (2009) - 2001
- [j4]Sergei G. Solodky:
The Optimal Approximations for Solving Linear Ill-Posed Problems. J. Complex. 17(1): 98-116 (2001) - [j3]Peter Maaß, Sergei V. Pereverzev, Ronny Ramlau, Sergei G. Solodky:
An adaptive discretization for Tikhonov-Phillips regularization with a posteriori parameter selection. Numerische Mathematik 87(3): 485-502 (2001)
1990 – 1999
- 1996
- [j2]Sergei V. Pereverzev, Sergei G. Solodky:
The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind. J. Complex. 12(4): 401-415 (1996) - 1993
- [j1]Sergei V. Pereverzev, Sergei G. Solodky:
On Optimization of Direct Methods of Solving Weakly Singular Integral Equations. J. Complex. 9(2): 313-325 (1993)
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-12-02 22:30 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:
