SearcharxivSearch

arXiv subjects

Talal Rahman

Publications and source records attributed to Talal Rahman.

At least 19 recordsLinked to original sources

Functional Analysis and Parallel Domain Decomposition for the TV-Stokes Model

The TV-Stokes model is a two-step variational method for image denoising that combines the estimation of a divergence-free tangent field with total variation regularization in the first step and then uses that to reconstruct the image in the second step. Although effective in practice, its mathematical structure and potential for parallelization have remained unexplored. In this work, we establish a rigorous functional-analytic foundation for the TV-Stokes model. We formulate both steps in appropriate infinite-dimensional function spaces, derive their dual formulations, and analyze the compatibility and mathematical consistency of the coupled system. In particular, we identify analytical inconsistencies in the original formulation and demonstrate how an alternative model resolves them. We also examine the orthogonal projection onto the divergence-free subspace, proving its existence in a continuous setting and establishing consistency with its discrete counterpart. Building on this theoretical framework, we develop the first domain decomposition method for TV-Stokes by applying overlapping Schwarz-type iterations to the duals of both steps. Although the divergence-free constraint gives rise to a global projection operator in the continuous model, we show that it becomes locally computable in the discrete setting. This insight enables a fully parallelizable algorithm suitable for large-scale image processing in memory-constrained environments. Numerical experiments demonstrate the correctness of the domain decomposition approach and its usability in parallel image reconstruction.

math.NA

On a vectorized basic linear algebra package for prototyping codes in MATLAB

When writing high-performance code for numerical computation in a scripting language like MATLAB, it is crucial to have the operations in a large for-loop vectorized. If not, the code becomes too slow to use, even for a moderately large problem. However, in the process of vectorizing, the code often loses its original structure and becomes less readable. This is particularly true in the case of a finite element implementation, even though finite element methods are inherently structured. A basic remedy to this is the separation of the vectorization part from the mathematics part of the code, which is easily achieved through building the code on top of the basic linear algebra subprograms that are already vectorized codes, an idea that has been used in a series of papers over the last fifteen years, developing codes that are fast and still structured and readable. We discuss the vectorized basic linear algebra package and introduce a formalism using multi-linear algebra to explain and define formally the functions in the package, as well as MATLAB pagetime functions. We provide examples from computations of varying complexity, including the computation of normal vectors, volumes, and finite element methods. Benchmarking shows that we also get fast computations. Using the library, we can write codes that closely follow our mathematical thinking, making writing, following, reusing, and extending the code easier.

cs.MS

Efficient Large-Scale Simulation of Fish Schooling Behavior Using Voronoi Tessellations and Fuzzy Clustering

This paper introduces an efficient approach to reduce the computational cost of simulating collective behaviors, such as fish schooling, using Individual-Based Models (IBMs). The proposed technique employs adaptive and dynamic load-balancing domain partitioning, which utilizes unsupervised machine-learning models to cluster a large number of simulated individuals into sub-schools based on their spatial-temporal locations. It also utilizes Voronoi tessellations to construct non-overlapping simulation subdomains. This approach minimizes agent-to-agent communication and balances the load both spatially and temporally, ultimately resulting in reduced computational complexity. Experimental simulations demonstrate that this partitioning approach outperforms the standard regular grid-based domain decomposition, achieving a reduction in computational cost while maintaining spatial and temporal load balance. The approach presented in this paper has the potential to be applied to other collective behavior simulations requiring large-scale simulations with a substantial number of individuals.

q-bio.PE

Tracking capelin spawning migration -- Integrating environmental data and Individual-based modeling

This paper presents a modeling framework for tracking the spawning migration of the capelin, which is a fish species in the Barents Sea. The framework combines an individual-based model (IBM) with artificial neural networks (ANNs). The ANNs determine the direction of the fish's movement based on local environmental information, while a genetic algorithm and fitness function assess the suitability of the proposed directions. The framework's efficacy is demonstrated by comparing the spatial distributions of modeled and empirical potential spawners. The proposed model successfully replicates the southeastward movement of capelin during their spawning migration, accurately capturing the distribution of spawning fish over historical spawning sites along the eastern coast of northern Norway. Furthermore, the paper compares three migration models: passive swimmers, taxis movement based on temperature gradients, and restricted-area search, along with our proposed approach. The results reveal that our approach outperforms the other models in mimicking the migration pattern. Most spawning stocks managed to reach the spawning sites, unlike the other models where water currents played a significant role in pushing the fish away from the coast. The temperature gradient detection model and restricted-area search model are found to be inadequate for accurately simulating capelin spawning migration in the Barents Sea due to complex oceanographic conditions.

q-bio.PE

Additive Average Schwarz Method for Elliptic Mortar Finite Element Problems with Highly Heterogeneous Coefficients

In this paper, we extend the additive average Schwarz method to solve second order elliptic boundary value problems with heterogeneous coefficients inside the subdomains and across their interfaces by the mortar technique, where the mortar finite element discretization is on nonmatching meshes. In this two-level method, we enrich the coarse space in two different ways, i.e., by adding eigenfunctions of two variants of the generalized eigenvalue problems. We prove that the condition numbers of the systems of algebraic equations resulting from the extended additive average Schwarz method, corresponding to both coarse spaces, are of the order O(H/h) and independent of jumps in the coefficients, where H and h are the mesh parameters.

math.NA

Alternating minimization for a single step TV-Stokes model for image denoising

The paper presents a fully coupled TV-Stokes model, and propose an algorithm based on alternating minimization of the objective functional whose first iteration is exactly the modified TV-Stokes model proposed earlier. The model is a generalization of the second order Total Generalized Variation model. A convergence analysis is given.

math.NA

Multidimensional TV-Stokes for image processing

A complete multidimential TV-Stokes model is proposed based on smoothing a gradient field in the first step and reconstruction of the multidimensional image from the gradient field. It is the correct extension of the original two dimensional TV-Stokes to multidimensions. Numerical algorithm using the Chambolle's semi-implicit dual formula is proposed. Numerical results applied to denoising 3D images and movies are presented. They show excellent performance in avoiding the staircase effect, and preserving fine structures.

math.NA

Sparse-data based 3D surface reconstruction with vector matching

Three dimensional surface reconstruction based on two dimensional sparse information in the form of only a small number of level lines of the surface with moderately complex structures, containing both structured and unstructured geometries, is considered in this paper. A new model has been proposed which is based on the idea of using normal vector matching combined with a first order and a second order total variation regularizers. A fast algorithm based on the augmented Lagrangian is also proposed. Numerical experiments are provided showing the effectiveness of the model and the algorithm in reconstructing surfaces with detailed features and complex structures for both synthetic and real world digital maps.

math.NA

Iterative regularization algorithms for image denoising with the TV-Stokes model

We propose a set of iterative regularization algorithms for the TV-Stokes model to restore images from noisy images with Gaussian noise. These are some extensions of the iterative regularization algorithm proposed for the classical Rudin-Osher-Fatemi (ROF) model for image reconstruction, a single step model involving a scalar field smoothing, to the TV-Stokes model for image reconstruction, a two steps model involving a vector field smoothing in the first and a scalar field smoothing in the second. The iterative regularization algorithms proposed here are Richardson's iteration like. We have experimental results that show improvement over the original method in the quality of the restored image. Convergence analysis and numerical experiments are presented.

math.NA

A priori error analysis of the $hp$-mortar FEM for parabolic problems

In this article we derive a priori error estimates for the $hp$-version of the mortar finite element method for parabolic initial-boundary value problems. Both semidiscrete and fully discrete methods are analysed in $L^2$- and $H^1$-norms. The superconvergence results for the solution of the semidiscrete problem are studied in an eqivalent negative norm, with an extra regularity assumption. Numerical experiments are conducted to validate the theoretical findings.

math.AP

Additive average Schwarz with adaptive coarse spaces: scalable algorithms for multiscale problems

We present an analysis of the additive average Schwarz preconditioner with two newly proposed adaptively enriched coarse spaces which was presented at the 23rd International conference on domain decomposition methods in Korea, for solving second order elliptic problems with highly varying and discontinuous coefficients. It is shown that the condition number of the preconditioned system is bounded independently of the variations and the jumps in the coefficient, and depends linearly on the mesh parameter ratio H/h, that is the ratio between the subdomain size and the mesh size, thereby retaining the same optimality and scalablity of the original additive average Schwarz preconditioner.

math.NA

Adaptively enriched coarse space for the discontinuous Galerkin multiscale problems

In this paper, we propose a two-level overlapping additive Schwarz domain decomposition preconditioner for the symmetric interior penalty discontinuous Galerkin method for the second order elliptic boundary value problem with highly heterogeneous coefficients. A specific feature of this preconditioner is that it is based on adaptively enriching its coarse space with functions created by solving generalized eigenvalue problems on thin patches covering the subdomain interfaces. It is shown that the condition number of the underlined preconditioned system is independent of the contrast if an adequate number of functions are used to enrich the coarse space. Numerical results are provided to confirm this claim.

math.NA

Overlapping Schwarz Methods with Adaptive Coarse Spaces for Multiscale Problems in 3D

We propose two variants of the overlapping additive Schwarz method for the finite element discretiza- tion of the elliptic problem in 3D with highly heterogeneous coefficients. The methods are efficient and simple to construct using the abstract framework of the additive Schwarz method, and an idea of adaptive coarse spaces. In one variant, the coarse space consists of finite element functions associated with the wire basket nodes and functions based on solving some generalized eigenvalue problem on the faces, and in the other variant, it contains functions associated with the vertex nodes with functions based on solving some generalized eigenvalue problems on subdomain faces and on subdomain edges. The functions that are used to build the coarse spaces are chosen adaptively, they correspond to the eigenvalues that are smaller than a given threshold. The convergence rate of the preconditioned conjugate gradients method in both cases, is shown to be independent of the variations in the coefficients for sufficient number of eigenfunctions in the coarse space. Numerical results are given to support the theory.

math.NA

Analysis of a New Harmonically Enriched Multiscale Coarse Space for Domain Decomposition Methods

We propose a new, harmonically enriched multiscale coarse space (HEM) for domain decomposition methods. For a coercive high contrast model problem, we show how to enrich the coarse space so that the method is robust against any variations and discontinuities in the problem parameters both inside subdomains and across and along subdomain boundaries. We prove our results for an enrichment strategy based on solving simple, lower dimensional eigenvalue problems on the interfaces between subdomains, and we call the resulting coarse space the spectral harmonically enriched multiscale coarse space (SHEM). We then also give a variant that performs equally well in practice, and does not require the solve of eigenvalue problems, which we call non-spectral harmonically enriched multiscale coarse space (NSHEM). Our enrichment process naturally reaches the optimal coarse space represented by the full discrete harmonic space, which enables us to turn the method into a direct solver (OHEM). We also extensively test our new coarse spaces numerically, and the results confirm our analysis

math.NA

Additive average Schwarz method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems with Heterogeneous Coefficients

In this paper we introduce an additive Schwarz method for a Crouzeix-Raviart Finite Volume Element (CRFVE) discretization of a second order elliptic problem with discontinuous coefficients, where the discontinuities are both inside the subdomains and across and along the subdomain boundaries. We show that, depending on the distribution of the coefficient in the model problem, the parameters describing the GMRES convergence rate of the proposed method depend linearly or quadratically on the mesh parameters $H/h$. Also, under certain restrictions on the distribution of the coefficient, the convergence of the GMRES method is independent of jumps in the coefficient.

math.NA

A FETI-DP preconditioner of discontinuous Galerkin method for multiscale problems in high constrast media

In this paper we consider second order elliptic partial differential equations with highly varying (heterogeneous) coefficients on a two-dimensional region. The problems are discretized by a composite finite element (FE) and discontinuous Galerkin (DG) Method. The fine grids are in general nonmatching across the subdomain boundaries, and the subdomain partitioning does not need to resolve the jumps in the coefficient. A FETI-DP preconditioner is proposed and analyzed to solve the resulting linear system. Numerical results are presented to support our theory.

math.NA

Edge based Schwarz methods for the Crouzeix-Raviart finite volume element discretization of elliptic problems

In this paper, we present two variants of the Additive Schwarz Method for a Crouzeix-Raviart finite volume element (CRFVE) discretization of second order elliptic problems with discontinuous coefficients where the discontinuities are only across subdomain boundaries. One preconditioner is symmetric while the other is nonsymmetric. The proposed methods are almost optimal, in the sense that the residual error estimates for the GMRES iteration in the both cases depend only polylogarithmically on the mesh parameters.

math.NA

Additive Schwarz preconditioner for the general finite volume element discretization of symmetric elliptic problems

A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a nonsymmetric system of algebraic equations arising from a general finite volume element discretization of symmetric elliptic problems with large jumps in the entries of the coefficient matrices across subdomains. It is shown in the analysis, that the convergence of the preconditioned GMRES iteration with the proposed preconditioners, depends polylogarithmically on the mesh parameters, in other words, the convergence is only weakly dependent on the mesh parameters, and it is robust with respect to the jumps in the coefficients.

math.NA