Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We are interested in the case of constrained minimum cut problems, where constraints include cardinality or membership requirements, which leads to NP-hard combinatorial optimization problems. Furthermore, we are interested in ambiguity issues, that is in the robustness of clustering algorithms that are based on Fiedler spectral partitioning. The above-mentioned problems are restated as matrix nearness problems for the weight matrix of the graph. A key element in the solution of these matrix nearness problems is the use of a constrained gradient system of matrix differential equations.
We study the discretization of an elliptic partial differential equation, posed on a two-or three-dimensional domain with smooth boundary, endowed with a generalized Robin boundary condition which involves the Laplace-Beltrami operator on the boundary surface. The boundary is approximated with piecewise polynomial faces and we use isoparametric finite elements of arbitrary order for the discretization. We derive optimal-order error bounds for this non-conforming finite element method in both L 2-and H 1-norm. Numerical examples illustrate the theoretical results.
We study the discretization of an elliptic partial differential equation, posed on a twoor three-dimensional domain with smooth boundary, endowed with a generalized Robin boundary condition which involves the Laplace-Beltrami operator on the boundary surface. The boundary is approximated with piecewise polynomial faces and we use isoparametric finite elements of arbitrary order for the discretization. We derive optimal-order error bounds for this non-conforming finite element method in both L 2 -and H 1 -norm. Numerical examples illustrate the theoretical results.
We study convergence of the evolving finite element semi-discretization of a parabolic partial differential equation on an evolving bulk domain. The boundary of the domain evolves with a given velocity, which is then extended to the bulk by solving a Poisson equation. The numerical solution to the parabolic equation depends on the numerical evolution of the bulk, which yields the time-dependent mesh for the finite element method. The stability analysis works with the matrix-vector formulation of the semidiscretization only and does not require geometric arguments, which are then required in the proof of consistency estimates. We present various numerical experiments that illustrate the proven convergence rates.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.