TY - GEN
T1 - Stable Explicit p-Laplacian Flows Based on Nonlinear Eigenvalue Analysis
AU - Cohen, Ido
AU - Falik, Adi
AU - Gilboa, Guy
N1 - Publisher Copyright: © 2019, Springer Nature Switzerland AG.
PY - 2019
Y1 - 2019
N2 - Implementation of nonlinear flows by explicit schemes can be very convenient, due to their simplicity and low-computational cost per time step. A well known drawback is the small time step bound, referred to as the CFL condition, which ensures a stable flow. For p-Laplacian flows, with (Formula Presented), explicit schemes without gradient regularization require, in principle, a time step approaching zero. However, numerical implementations show explicit flows with small time-steps are well behaved. We can now explain and quantify this phenomenon. In this paper we examine explicit p-Laplacian flows by analyzing the evolution of nonlinear eigenfunctions, with respect to the p-Laplacian operator. For these cases analytic solutions can be formulated, allowing for a comprehensive analysis. A generalized CFL condition is presented, relating the time step to the inverse of the nonlinear eigenvalue. Moreover, we show that the flow converges and formulate a bound on the error of the discrete scheme. Finally, we examine general initial conditions and propose a dynamic time-step bound, which is based on a nonlinear Rayleigh quotient.
AB - Implementation of nonlinear flows by explicit schemes can be very convenient, due to their simplicity and low-computational cost per time step. A well known drawback is the small time step bound, referred to as the CFL condition, which ensures a stable flow. For p-Laplacian flows, with (Formula Presented), explicit schemes without gradient regularization require, in principle, a time step approaching zero. However, numerical implementations show explicit flows with small time-steps are well behaved. We can now explain and quantify this phenomenon. In this paper we examine explicit p-Laplacian flows by analyzing the evolution of nonlinear eigenfunctions, with respect to the p-Laplacian operator. For these cases analytic solutions can be formulated, allowing for a comprehensive analysis. A generalized CFL condition is presented, relating the time step to the inverse of the nonlinear eigenvalue. Moreover, we show that the flow converges and formulate a bound on the error of the discrete scheme. Finally, we examine general initial conditions and propose a dynamic time-step bound, which is based on a nonlinear Rayleigh quotient.
UR - http://www.scopus.com/inward/record.url?scp=85068485106&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-030-22368-7_25
DO - https://doi.org/10.1007/978-3-030-22368-7_25
M3 - منشور من مؤتمر
SN - 9783030223670
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 315
EP - 327
BT - Scale Space and Variational Methods in Computer Vision - 7th International Conference, SSVM 2019, Proceedings
A2 - Lellmann, Jan
A2 - Modersitzki, Jan
A2 - Burger, Martin
T2 - 7th International Conference on Scale Space and Variational Methods in Computer Vision, SSVM 2019
Y2 - 30 June 2019 through 4 July 2019
ER -