A study on single-iteration sobolev descent for linear initial value problems

OPTICAL AND QUANTUM ELECTRONICS(2021)

Cited 7|Views3
No score
Abstract
Mahavier and Montgomery construct a Sobolev space for approximate solution of linear initial value problems in a finite difference setting in single-iteration sobolev descent for linear initial value problems, Mahavier, Montgomery, MJMS, 2013. Their Sobolev space is constructed so that gradient-descent converges to a solution in a single iteration, demonstrating the existence of a best Sobolev gradient for finite difference approximation of solutions of linear initial value problems. They then ask if there is a broader class of problems for which convergence in a single iteration in an appropriate Sobolev space occurs. We use their results to show the existence of single-step iteration to solution in a lower dimensional Sobolev space for their examples and then a class of problems for single-step convergence.
More
Translated text
Key words
Single iteration,Steepest descent method,Sobolev gradients
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined