A fixed point formulation of the -means algorithm and a connection to Mumford-Shah.
A fixed point method to compute solvents of matrix polynomials
Matrix polynomials play an important role in the theory of matrix differential equations. We develop a fixed point method to compute solutions of matrix polynomials equations, where the matricial elements of the matrix polynomial are considered separately as complex polynomials. Numerical examples illustrate the method presented.
A Floating-Point Technique for Extending the Available Precision.
A footnote on quaternion block-tridiagonal systems.
A forced quasilinear wave equation with dissipation
A Fortin operator for two-dimensional Taylor-Hood elements
A standard method for proving the inf-sup condition implying stability of finite element approximations for the stationary Stokes equations is to construct a Fortin operator. In this paper, we show how this can be done for two-dimensional triangular and rectangular Taylor-Hood methods, which use continuous piecewise polynomial approximations for both velocity and pressure.
A Fourier approach to model electromagnetic fields scattered by a buried rectangular cavity.
A frequency decomposition waveform relaxation algorithm for semilinear evolution equations.
A frictionless contact problem for viscoelastic materials.
A full discretization of the time-dependent Navier-Stokes equations by a two-grid scheme
We study a two-grid scheme fully discrete in time and space for solving the Navier-Stokes system. In the first step, the fully non-linear problem is discretized in space on a coarse grid with mesh-size H and time step k. In the second step, the problem is discretized in space on a fine grid with mesh-size h and the same time step, and linearized around the velocity uH computed in the first step. The two-grid strategy is motivated by the fact that under suitable assumptions, the contribution of uH...
A full multigrid method for semilinear elliptic equation
A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and semilinear problems on a very low dimensional space. The linearized boundary value problems are solved by some multigrid iterations. Besides the multigrid iteration, all other efficient numerical methods can also serve as...
A full-Newton approach to separable nonlinear least squares problems and its application to discrete least squares rational approximation.
A fully discrete discontinuous Galerkin method for nonlinear fractional Fokker-Planck equation.
A fully parallel method for tridiagonal eigenvalue problem.
A Fully Stable Rational Version of the QR Algorithm for Tridiagonal Matrices.
A functional calculus for Rockland operators on nilpotent Lie groups
A fundamental property of -splines.
A Gagliardo-Nirenberg inequality, with application to duality-based a posteriori estimation in the L^1 norm
A Galerkin method of for singular boundary value problems.
A Galerkin Method with Modified Piecewise Polynomials for Solving a Second-Order Boundary Value Problem.