Problem statement: Not all differential equations can be solved analytically, to overcome this problem, there is need to search for an accurate approximate solution. Approach: The objective of this study was to find an accurate approximation technique (scheme) for solving linear differential equations. By exploiting the Trigonometric identity property of the Chebyshev polynomial, we developed a...

We consider concave minimization problems over nonconvex sets. Optimization problems with this structure arise in sparse principal component analysis. We analyze both a gradient projection algorithm and an approximate Newton algorithm where the Hessian approximation is a multiple of the identity. Convergence results are established. In numerical experiments arising in sparse principal component...

We revisit Smith’s frame of curvelets and discretize it making use of the USFFT as developed by Dutt and Roklin, and Beylkin. In the discretization, we directly approximate the underlying dyadic parabolic decomposition, its (rotational) symmetry, and approximate all the necessary decay estimates in phase space with arbitrary accuracy. Numerically, our transform is unitary. Moreover, if we apply...

In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...

We consider in dimension four weakly convergent sequences of approximate biharmonic maps into sphere with bi-tension fields bounded in L for some p > 1. We prove an energy identity that accounts for the loss of Hessian energies by the sum of Hessian energies over finitely many nontrivial biharmonic maps on R.

Let X and A be sets and α : X → A a map between them. We call a map μ : X ×X ×X → A an approximate Mal’tsev operation with approximation α, if it satisfies μ(x, y, y) = α(x) = μ(y, y, x) for all x, y ∈ X. Note that if A = X and the approximation α is an identity map, then μ becomes an ordinary Mal’tsev operation. We prove the following two characterization theorems: a category X is a Mal’tsev c...

The rule of an approximate identity is as follows: A function f which has to be approximated is convolved with a kernel Kδ for some δ. If the kernel satisfies certain conditions then the convolutions converge in a certain limit such as δ → 0+ to f . Note that approximate identities for scalar function on balls in R are studied e.g. in [14]. Further works on localizing kernels, like scaling func...

we de ne approximate xed point in fuzzy norm spaces and prove the existence theorems, we also consider approximate pair constructive map- ping and show its relation with approximate fuzzy xed point.

Abstract Port-based teleportation (PBT) is a protocol that employs number of Bell pairs and joint measurement to enact an approximate input-output identity channel. Replacing the with different multi-qubit resource state changes enacted channel allows PBT simulate qubit channels beyond identity. The resulting from using general consequently interest. In this work, we fully characterise Choi mat...