Igor Kaporin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Igor Kaporin has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- François Protais
LORIA Université de Lorraine CNRS Inria
3 shared publications - Liudmila N. Kudryavtseva
Russian Academy of Sciences
3 shared publications - Vladimir A. Garanzha
Dorodnicyn Computing Center FRC CSC RAS
3 shared publications - Alexander I. Golikov
Dorodnicyn Computing Centre, FRC “Computer Science and Control” of RAS
2 shared publications - Dmitry Sokolov
Université de Lorraine, CNRS, Inria, LORIA
2 shared publications David Desobry
Pixel
1 shared publication
Latest Publications
- 1 July 2025
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 65 (7) , 1487-1494
Symmetric Triangular Factorization for Approximating Solutions of the Quadratic Assignment Problem
Permutation matrices resulting from triangular factorization of shifted symmetric matrices with pivoting are used as initial approximations for a series of elementary permutations improving the objective function value in the quadratic assignment problem. The proposed method is tested on 128 test problems from QAPLIB.
- 1 July 2025
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 65 (7) , 1487-1494
Symmetric Triangular Factorization for Approximating Solutions of the Quadratic Assignment Problem
Permutation matrices resulting from triangular factorization of shifted symmetric matrices with pivoting are used as initial approximations for a series of elementary permutations improving the objective function value in the quadratic assignment problem. The proposed method is tested on 128 test problems from QAPLIB.
- 1 September 2024
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 64 (9) , 1881-1891
Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares
Finding nontrivial solutions of trilinear Brent equations corresponds to the construction of asymptotically fast matrix multiplication algorithms and is considered as an important but generally very hard computational problem. Based on symmetries of matrix multiplication tensor, some new parametrizations of Brent equations are proposed which admit for several times reduction in the number of unknowns and equations. The arising equations are solved numerically over complex numbers using a specialized derivative-free nonlinear least squares solver. For the resulting fast matrix multiplication algorithms many known values of rank are reproduced and even improved. In particular, an algorithm for the multiplication of 4th order matrices in 48 bilinear multiplications is found.
- 1 September 2024
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 64 (9) , 1881-1891
Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares
Finding nontrivial solutions of trilinear Brent equations corresponds to the construction of asymptotically fast matrix multiplication algorithms and is considered as an important but generally very hard computational problem. Based on symmetries of matrix multiplication tensor, some new parametrizations of Brent equations are proposed which admit for several times reduction in the number of unknowns and equations. The arising equations are solved numerically over complex numbers using a specialized derivative-free nonlinear least squares solver. For the resulting fast matrix multiplication algorithms many known values of rank are reproduced and even improved. In particular, an algorithm for the multiplication of 4th order matrices in 48 bilinear multiplications is found.
- 1 August 2024
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 110 (1) , 318-322
Semi-Analytical Solution of Brent Equations
A parametrization of Brent equations is proposed which leads to a several times reduction of the number of unknowns and equations. The arising equations are solved numerically using a nonlinear least squares method. Matrix multiplication algorithms that are faster than previously known ones are obtained. In particular, \((4,4,4;48)\)- and \((2,4,5;32)\)-algorithms are found.- 1 August 2024
- Published by Pleiades Publishing Ltd in Doklady Mathematics
- Vol. 110 (1) , 318-322
Semi-Analytical Solution of Brent Equations
A parametrization of Brent equations is proposed which leads to a several times reduction of the number of unknowns and equations. The arising equations are solved numerically using a nonlinear least squares method. Matrix multiplication algorithms that are faster than previously known ones are obtained. In particular, \((4,4,4;48)\)- and \((2,4,5;32)\)-algorithms are found.- Open Access
- 3 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (1) , 1-16
In the Quest for Scale-optimal Mappings
Optimal mapping is one of the longest-standing problems in computational mathematics. It is natural to measure the relative curve length error under map to assess its quality. The maximum of such error is called the quasi-isometry constant, and its minimization is a nontrivial max-norm optimization problem. We present a physics-based quasi-isometric stiffening (QIS) algorithm for the max-norm minimization of hyperelastic distortion. QIS perfectly equidistributes distortion over the entire domain for the ground-truth test (unit hemisphere flattening) and, when it is not possible, tends to create zones where all cells have the same distortion. Such zones correspond to fragments of elastic material that became rigid under stiffening, reaching the deformation limit. As such, maps built by QIS are related to the de Boor equidistribution principle, which asks for an integral of a certain error indicator function to be the same over each mesh cell. Under certain assumptions on the minimization toolbox, we prove that our method can build, in a finite number of steps, a deformation whose maximum distortion is arbitrarily close to the (unknown) minimum. We performed extensive testing: on more than 10,000 domains QIS was reliably better than the competing methods. In summary, we reliably build 2D and 3D mesh deformations with the smallest known distortion estimates for very stiff problems.
- 3 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (1) , 1-16
Open AccessIn the Quest for Scale-optimal Mappings
Optimal mapping is one of the longest-standing problems in computational mathematics. It is natural to measure the relative curve length error under map to assess its quality. The maximum of such error is called the quasi-isometry constant, and its minimization is a nontrivial max-norm optimization problem. We present a physics-based quasi-isometric stiffening (QIS) algorithm for the max-norm minimization of hyperelastic distortion. QIS perfectly equidistributes distortion over the entire domain for the ground-truth test (unit hemisphere flattening) and, when it is not possible, tends to create zones where all cells have the same distortion. Such zones correspond to fragments of elastic material that became rigid under stiffening, reaching the deformation limit. As such, maps built by QIS are related to the de Boor equidistribution principle, which asks for an integral of a certain error indicator function to be the same over each mesh cell. Under certain assumptions on the minimization toolbox, we prove that our method can build, in a finite number of steps, a deformation whose maximum distortion is arbitrarily close to the (unknown) minimum. We performed extensive testing: on more than 10,000 domains QIS was reliably better than the competing methods. In summary, we reliably build 2D and 3D mesh deformations with the smallest known distortion estimates for very stiff problems.
- 10 November 2023
- Published by Springer Nature
- p. 45-59
A Derivative-Free Nonlinear Least Squares Solver for Nonsmooth Functions
- 10 November 2023
- Published by Springer Nature
- p. 45-59
A Derivative-Free Nonlinear Least Squares Solver for Nonsmooth Functions
- Open Access
Practical lowest distortion mapping
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for relative length change).We build our technique upon [Garanzha et al. 2021a], a recently proposed numerical optimization scheme that provably untangles 2D and 3D meshes with inverted elements by partially solving a finite number of minimization problems. In this paper we show the similarity between continuation problems for mesh untangling and for attaining prescribed deformation quality threshold. Both problems can be solved by a finite number of partial solutions of optimization problems which are based on finite element approximations of parameter-dependent hyperelastic functionals. Our method is based on a polyconvex functional which admits a well-posed variational problem. To sum up, we reliably build 2D and 3D mesh deformations with smallest known distortion estimates (quasi-isometry constants) as well as stable quasi conformal parameterizations for very stiff problems.
Open AccessPractical lowest distortion mapping
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for relative length change).We build our technique upon [Garanzha et al. 2021a], a recently proposed numerical optimization scheme that provably untangles 2D and 3D meshes with inverted elements by partially solving a finite number of minimization problems. In this paper we show the similarity between continuation problems for mesh untangling and for attaining prescribed deformation quality threshold. Both problems can be solved by a finite number of partial solutions of optimization problems which are based on finite element approximations of parameter-dependent hyperelastic functionals. Our method is based on a polyconvex functional which admits a well-posed variational problem. To sum up, we reliably build 2D and 3D mesh deformations with smallest known distortion estimates (quasi-isometry constants) as well as stable quasi conformal parameterizations for very stiff problems.
- 1 January 2022
- Published by Springer Nature
- p. 3-17
A Derivative-Free Nonlinear Least Squares Solver
- 5 November 2021
- Published by Springer Nature
- p. 217-230
A Derivative-Free Nonlinear Least Squares Solver
- 5 November 2021
- Published by Springer Nature
- p. 217-230
A Derivative-Free Nonlinear Least Squares Solver
- Open Access
- 1 August 2021
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 40 (4) , 1-16
Foldover-free maps in 50 lines of code
- 1 August 2021
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 40 (4) , 1-16
Open AccessFoldover-free maps in 50 lines of code
- 4 November 2020
- Published by Springer Nature
- p. 184-195
Nonlinear Least Squares Solver for Evaluating Canonical Tensor Decomposition
- 4 November 2020
- Published by Springer Nature
- p. 184-195
Nonlinear Least Squares Solver for Evaluating Canonical Tensor Decomposition