Pages that link to "Item:Q2209522"
From MaRDI portal
The following pages link to Efficient algorithms for solving the \(p\)-Laplacian in polynomial time (Q2209522):
Displaying 10 items.
- The steepest descent algorithm without line search for \(p\)-Laplacian (Q278924) (← links)
- Efficient MFS algorithms for inhomogeneous polyharmonic problems (Q361560) (← links)
- A finite difference method for the variational \(p\)-Laplacian (Q2063222) (← links)
- Preconditioned descent algorithms for \(p\)-Laplacian (Q2385516) (← links)
- Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse (Q4608054) (← links)
- Space-Time Approximation of Stochastic $p$-Laplace-Type Systems (Q5009345) (← links)
- Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball (Q5383974) (← links)
- Lx = b (Q5396760) (← links)
- Conditional variational autoencoder with Gaussian process regression recognition for parametric models (Q6056206) (← links)
- Relaxed Kačanov Scheme for the \(\boldsymbol{p}\)-Laplacian with Large Exponent (Q6091101) (← links)
