Related papers: The diagonalization method and Brocard's problem
This paper is concerned with recovering the solution of a final value problem associated with a parabolic equation involving a non linear source and a non-local term, which to the best of our knowledge has not been studied earlier. It is…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
We establish the existence of multi-bump solutions for the following class of quasilinear problems $$ - \Delta_{ p(x) } u + \big( \lambda V(x) + Z(x) \big) u ^{ p(x)-1 } = f(x,u) \text{ in } \mathbb R^N, \, u \ge 0 \text{ in } \mathbb R^N,…
Real-time thermal field theory is known in the two flavors ``closed-time path formalism'' and ``thermo field dynamics''. With a certain choice of parameters the full two-point functions of these models are identical, hence a scheme to…
We show that the Dirac factorization method can be successfully employed to treat problems involving operators raised to a fractional power. The technique we adopt is based on an extension of the Pauli matrices and the properties of the…
Often the easiest way to discretize an ordinary or partial differential equation is by a rectangular numerical method, in which n basis functions are sampled at m>>n collocation points. We show how eigenvalue problems can be solved in this…
Regularization methods are a key tool in the solution of inverse problems. They are used to introduce prior knowledge and make the approximation of ill-posed (pseudo-)inverses feasible. In the last two decades interest has shifted from…
In this paper, we present a spectral method based on Radial Basis Functions (RBFs) for numerically solving the fully nonlinear 1D Serre Green-Naghdi equations. The approximation uses an RBF discretization in space and finite differences in…
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large\rev{-}scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized…
We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…
We study the optimization of functions with $n>2$ arguments that have a representation as a sum of several functions that have only $2$ of the $n$ arguments each, termed sums of bivariates, on finite domains. The complexity of optimizing…
We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…
In this paper, we are concerned with the following equation involving higher-order fractional Lapalacian \begin{equation*} \left\{\begin{aligned} &(-\Delta)^{p+{\frac{\alpha}{2}}}u(x)=u_+^\gamma~~ \mbox{ in }\mathbb{R}^n,\\…
The problem of diagonalizing hermitian matrices of continuous fiunctions was studied by Grove and Pederson in 1984. While diagonalization is not possible in general, in the presence of differentiability conditions we are able to obtain…
In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…
In this note we develop a numerical method for partial differential equations with changing type. Our method is based on a unified solution theory found by Rainer Picard for several linear equations from mathematical physics. Parallel to…
We consider a closed Riemannian manifold $(M^n ,g)$ of dimension $n\geq 3$ and study positive solutions of the equation $-\Delta_g u + \lambda u = \lambda u^q$, with $\lambda >0$, $q>1$. If $M$ supports a proper isoparametric function with…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
Using the section method we characterize the solutions $ f:U\rightarrow Y$ of the following four equations \begin{equation*} \sum\limits_{i=0}^{n}\left( -1\right) ^{n-i}\tbinom{n}{i}f\left( \sqrt[m]{ u^{m}+iv^{m}}\right) =\left( n!\right)…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…