default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor E. Kaporin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Vladimir A. Garanzha
, Igor E. Kaporin, Liudmila N. Kudryavtseva, François Protais, Dmitry Sokolov:
In the Quest for Scale-optimal Mappings. ACM Trans. Graph. 43(1): 8:1-8:16 (2024)- 2023
- [c7]Igor E. Kaporin:
A Derivative-Free Nonlinear Least Squares Solver for Nonsmooth Functions. OPTIMA 2023: 45-59 - 2022
- [c6]Igor E. Kaporin:
A Derivative-Free Nonlinear Least Squares Solver. OPTIMA (2) 2022: 3-17 - [i2]Vladimir A. Garanzha, Igor E. Kaporin, Liudmila N. Kudryavtseva, François Protais, David Desobry, Dmitry Sokolov:
Practical lowest distortion mapping. CoRR abs/2201.12112 (2022) - 2021
- [j14]Vladimir A. Garanzha, Igor E. Kaporin, Liudmila N. Kudryavtseva, François Protais, Nicolas Ray, Dmitry Sokolov:
Foldover-free maps in 50 lines of code. ACM Trans. Graph. 40(4): 102:1-102:16 (2021) - [c5]Igor E. Kaporin:
A Derivative-Free Nonlinear Least Squares Solver. OPTIMA 2021: 217-230 - [i1]Vladimir A. Garanzha, Igor E. Kaporin, Liudmila N. Kudryavtseva, François Protais, Nicolas Ray, Dmitry Sokolov:
Foldover-free maps in 50 lines of code. CoRR abs/2102.03069 (2021) - 2020
- [j13]Igor E. Kaporin:
Preconditioned Subspace Descent Method for Nonlinear Systems of Equations. Open Comput. Sci. 10(1): 71-81 (2020) - [j12]Kirill V. Demyanko, Igor E. Kaporin, Yuri M. Nechepurenko:
Inexact Newton method for the solution of eigenproblems arising in hydrodynamic temporal stability analysis. J. Num. Math. 28(1): 1-14 (2020) - [c4]Igor E. Kaporin:
Nonlinear Least Squares Solver for Evaluating Canonical Tensor Decomposition. OPTIMA 2020: 184-195
2000 – 2009
- 2009
- [c3]Igor E. Kaporin, Igor N. Konshin:
Load Balancing of Parallel Block Overlapped Incomplete Cholesky Preconditioning. PaCT 2009: 304-315 - 2005
- [j11]Igor E. Kaporin:
Superlinear convergence in minimum residual iterations. Numer. Linear Algebra Appl. 12(5-6): 453-470 (2005) - 2004
- [j10]Vladimir A. Garanzha, Igor E. Kaporin, Igor N. Konshin:
Truncated Newton type solver with application to grid untangling problem. Numer. Linear Algebra Appl. 11(5-6): 525-533 (2004) - [j9]Igor E. Kaporin:
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication. Theor. Comput. Sci. 315(2-3): 469-510 (2004) - 2002
- [j8]Igor E. Kaporin, Igor N. Konshin:
A parallel block overlap preconditioning with inexact submatrix inversion for linear elasticity problems. Numer. Linear Algebra Appl. 9(2): 141-162 (2002) - [j7]Igor E. Kaporin:
Using the modified 2nd order incomplete Cholesky decomposition as the conjugate gradient preconditioning. Numer. Linear Algebra Appl. 9(6-7): 401-408 (2002) - 2001
- [j6]Owe Axelsson, Igor E. Kaporin:
Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations. Numer. Linear Algebra Appl. 8(4): 265-286 (2001) - [c2]Owe Axelsson, Igor E. Kaporin:
Optimizing Two-Level Preconditionings for the Conjugate Gradient Method. LSSC 2001: 3-21 - 2000
- [j5]Owe Axelsson, Igor E. Kaporin:
On the sublinear and superlinear rate of convergence of conjugate gradient methods. Numer. Algorithms 25(1-4): 1-22 (2000)
1990 – 1999
- 1999
- [j4]Igor E. Kaporin:
A practical algorithm for faster matrix multiplication. Numer. Linear Algebra Appl. 6(8): 687-700 (1999) - [c1]Igor E. Kaporin, Igor N. Konshin:
Parallel Solution of Large Sparse SPD Linear Systems Based on Overlapping Domain Decomposition. PaCT 1999: 436-445 - 1998
- [j3]Igor E. Kaporin:
High quality preconditioning of a general symmetric positive definite matrix based on its UTU + UTR + RTU-decomposition. Numer. Linear Algebra Appl. 5(6): 483-509 (1998) - 1995
- [j2]Igor E. Kaporin, Owe Axelsson:
On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces. SIAM J. Sci. Comput. 16(1): 228-249 (1995) - 1994
- [j1]Igor E. Kaporin:
New convergence results and preconditioning strategies for the conjugate gradient method. Numer. Linear Algebra Appl. 1(2): 179-210 (1994)
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-25 05:55 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:
