On the solutions of some linear complex quaternionic equations.
Ontology highlight
ABSTRACT:
SUBMITTER: Bolat C
PROVIDER: S-EPMC4101936 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Embryonic development involves diffusion and proliferation of cells, as well as diffusion and reaction of molecules, within growing tissues. Mathematical models of these processes often involve reaction-diffusion equations on growing domains that have been primarily studied using approximate numerical solutions. Recently, we have shown how to obtain an exact solution to a single, uncoupled, linear reaction-diffusion equation on a growing domain, 0 < x < L(t), where L(t) is the domain length. The present work is an extension of our previous study, and we illustrate how to solve a system of coupled reaction-diffusion equations on a growing domain. This system of equations can be used to study the spatial and temporal distributions of different generations of cells within a population that diffuses and proliferates within a growing tissue. The exact solution is obtained by applying an uncoupling transformation, and the uncoupled equations are solved separately before applying the inverse uncoupling transformation to give the coupled solution. We present several example calculations to illustrate different types of behaviour. The first example calculation corresponds to a situation where the initially-confined population diffuses sufficiently slowly that it is unable to reach the moving boundary at x = L(t). In contrast, the second example calculation corresponds to a situation where the initially-confined population is able to overcome the domain growth and reach the moving boundary at x = L(t). In its basic format, the uncoupling transformation at first appears to be restricted to deal only with the case where each generation of cells has a distinct proliferation rate. However, we also demonstrate how the uncoupling transformation can be used when each generation has the same proliferation rate by evaluating the exact solutions as an appropriate limit.
| S-EPMC4583548 | biostudies-literature
Project description:Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polytopes. Let a(j) denote the jth column of A, 1 < or = j < or = n, let a0 = 0 and P denote the convex hull of the a(j). We say the polytope P is outwardly k-neighborly if every subset of k vertices not including 0 spans a face of P. We show that outward k-neighborliness is equivalent to the statement that, whenever y = Ax has a nonnegative solution with at most k nonzeros, it is the nonnegative solution to y = Ax having minimal sum. We also consider weak neighborliness, where the overwhelming majority of k-sets of a(j)s not containing 0 span a face of P. This implies that most nonnegative vectors x with k nonzeros are uniquely recoverable from y = Ax by linear programming. Numerous corollaries follow by invoking neighborliness results. For example, for most large n by 2n underdetermined systems having a solution with fewer nonzeros than roughly half the number of equations, the sparsest solution can be found by linear programming.
| S-EPMC1172251 | biostudies-literature
Project description:The question of finite-time blowup of the 3D incompressible Euler equations is numerically investigated in a periodic cylinder with solid boundaries. Using rotational symmetry, the equations are discretized in the (2D) meridian plane on an adaptive (moving) mesh and is integrated in time with adaptively chosen time steps. The vorticity is observed to develop a ring-singularity on the solid boundary with a growth proportional to ∼(ts - t)(-2.46), where ts ∼ 0.0035056 is the estimated singularity time. A local analysis also suggests the existence of a self-similar blowup. The simulations stop at τ(2) = 0.003505 at which time the vorticity amplifies by more than (3 × 10(8))-fold and the maximum mesh resolution exceeds (3 × 10(12))(2). The vorticity vector is observed to maintain four significant digits throughout the computations.
| S-EPMC4246962 | biostudies-literature
Project description:We consider a setting in which it is desired to find an optimal complex vector x ∈ C N that satisfies A (x) ≈ b in a least-squares sense, where b ∈ C M is a data vector (possibly noise-corrupted), and A (·) : C N → C M is a measurement operator. If A (·) were linear, this reduces to the classical linear least-squares problem, which has a well-known analytic solution as well as powerful iterative solution algorithms. However, instead of linear least-squares, this work considers the more complicated scenario where A (·) is nonlinear, but can be represented as the summation and/or composition of some operators that are linear and some operators that are antilinear. Some common nonlinear operations that have this structure include complex conjugation or taking the real-part or imaginary-part of a complex vector. Previous literature has shown that this kind of mixed linear/antilinear least-squares problem can be mapped into a linear least-squares problem by considering x as a vector in R 2N instead of C N . While this approach is valid, the replacement of the original complex-valued optimization problem with a real-valued optimization problem can be complicated to implement, and can also be associated with increased computational complexity. In this work, we describe theory and computational methods that enable mixed linear/antilinear least-squares problems to be solved iteratively using standard linear least-squares tools, while retaining all of the complex-valued structure of the original inverse problem. An illustration is providedtodemonstratethatthisapproachcansimplifytheimplementationandreduce the computational complexity of iterative solution algorithms.
| S-EPMC9159680 | biostudies-literature
Project description:In this paper, we present a formal quantification of uncertainty induced by numerical solutions of ordinary and partial differential equation models. Numerical solutions of differential equations contain inherent uncertainties due to the finite-dimensional approximation of an unknown and implicitly defined function. When statistically analysing models based on differential equations describing physical, or other naturally occurring, phenomena, it can be important to explicitly account for the uncertainty introduced by the numerical method. Doing so enables objective determination of this source of uncertainty, relative to other uncertainties, such as those caused by data contaminated with noise or model error induced by missing physical or inadequate descriptors. As ever larger scale mathematical models are being used in the sciences, often sacrificing complete resolution of the differential equation on the grids used, formally accounting for the uncertainty in the numerical method is becoming increasingly more important. This paper provides the formal means to incorporate this uncertainty in a statistical model and its subsequent analysis. We show that a wide variety of existing solvers can be randomised, inducing a probability measure over the solutions of such differential equations. These measures exhibit contraction to a Dirac measure around the true unknown solution, where the rates of convergence are consistent with the underlying deterministic numerical method. Furthermore, we employ the method of modified equations to demonstrate enhanced rates of convergence to stochastic perturbations of the original deterministic problem. Ordinary differential equations and elliptic partial differential equations are used to illustrate the approach to quantify uncertainty in both the statistical analysis of the forward and inverse problems.
| S-EPMC7089645 | biostudies-literature
Project description:Calculus equations serve as fundamental frameworks in mathematics, enabling describing an extensive range of natural phenomena and scientific principles, such as thermodynamics and electromagnetics. Analog computing with electromagnetic waves presents an intriguing opportunity to solve calculus equations with unparalleled speed, while facing an inevitable tradeoff in computing density and equation reconfigurability. Here, we propose a reconfigurable metamaterial processing unit (MPU) that solves arbitrary linear calculus equations at a very fast speed. Subwavelength kernels based on inverse-designed pixel metamaterials are used to perform calculus operations on time-domain signals. In addition, feedback mechanisms and reconfigurable components are used to formulate and solve calculus equations with different orders and coefficients. A prototype of this MPU with a compact planar size of 0.93λ0×0.93λ0 (λ0 is the free-space wavelength) is constructed and evaluated in microwave frequencies. Experimental results demonstrate the MPU's ability to successfully solve arbitrary linear calculus equations. With the merits of compactness, easy integration, reconfigurability, and reusability, the proposed MPU provides a potential route for integrated analog computing with high speed of signal processing.
| S-EPMC11269748 | biostudies-literature
Project description:We present an algorithm to solve the linear response equations for Hartree-Fock, Density Functional Theory, and the Multiconfigurational Self-Consistent Field method that is both simple and efficient. The algorithm makes use of the well-established symmetric and antisymmetric combinations of trial vectors but further orthogonalizes them with respect to the scalar product induced by the response matrix. This leads to a standard, symmetric block eigenvalue problem in the expansion subspace that can be solved by diagonalizing a symmetric, positive definite matrix half the size of the expansion space. Numerical tests showed that the algorithm is robust and stable.
| S-EPMC10753806 | biostudies-literature
Project description:We are concerned with the positive solutions of an algebraic system depending on a parameter [Formula: see text] and arising in economics. For [Formula: see text] we prove that the system has at least a solution. For [Formula: see text] we give three proofs of the existence and a proof of the uniqueness of the solution. Brouwer's theorem and inequalities involving convex functions are essential tools in our proofs.
| S-EPMC5539268 | biostudies-other
Project description:The quantum imaginary time evolution (QITE) methodology was developed to overcome a critical issue as regards non-unitarity in the implementation of imaginary time evolution on a quantum computer. QITE has since been used to approximate ground states of various physical systems. In this paper, we demonstrate a practical application of QITE as a quantum numerical solver for linear partial differential equations. Our algorithm takes inspiration from QITE in that the quantum state follows the same normalised trajectory in both algorithms. However, it is our QITE methodology's ability to track the scale of the state vector over time that allows our algorithm to solve differential equations. We demonstrate our methodology with numerical simulations and use it to solve the heat equation in one and two dimensions using six and ten qubits, respectively.
| S-EPMC11364816 | biostudies-literature
Project description:OBJECTIVES:The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that Regula-Falsi method always gives guaranteed result but slow convergence. However, Newton-Raphson method does not give guaranteed result but faster than Regula-Falsi method. Therefore, the present paper used these two ideas and developed a new algorithm which has better convergence than Regula-Falsi and guaranteed result. One of the major issue in Newton-Raphson method is, it fails when first derivative is zero or approximately zero. RESULTS:The proposed method implemented the failure condition of Newton-Raphson method with better convergence. Error calculation has been discussed for certain real life examples using Bisection, Regula-Falsi, Newton-Raphson method and new proposed method. The computed results show that the new proposed quadratically convergent method provides better convergence than other methods.
| S-EPMC6302413 | biostudies-literature