Convergence Analysis of the Algorithm in "Efficient and Robust Discrete Conformal Equivalence with Boundary"

09/08/2021
by   Denis Zorin, et al.
0

In this note we prove that the version of Newton algorithm with line search we used in [2] converges quadratically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2019

Convergence of a damped Newton's method for discrete Monge-Ampere functions with a prescribed asymptotic cone

We prove the convergence of a damped Newton's method for the nonlinear s...
research
11/22/2021

On the Equivalence of the Newton-Raphson Algorithm and PDE of Conservation of Electric Charge

The main result characterises the equivalence of the Newton-Raphson algo...
research
07/22/2019

The k-Dimensional Weisfeiler-Leman Algorithm

In this note, we provide details of the k-dimensional Weisfeiler-Leman A...
research
06/18/2019

A Note on Sequences of Lattices

We investigate the relation between the convergence of a sequence of lat...
research
05/22/2020

HPC compact quasi-Newton algorithm for interface problems

In this work we present a robust interface coupling algorithm called Com...
research
05/06/2017

On Discrete Conformal Seamless Similarity Maps

An algorithm for the computation of global discrete conformal parametriz...
research
04/09/2021

Efficient and Robust Discrete Conformal Equivalence with Boundary

We describe an efficient algorithm to compute a conformally equivalent m...

Please sign up or login with your details

Forgot password? Click here to reset