A multiscale Galerkin method for the hypersingular integral equation reduced by the harmonic equation

The aim of this paper is to investigate the numerical solution of the hypersingular integral equation reduced by the harmonic equation. First, we transform the hypersingular integral equation into 2π-periodic hypersingular integral equation with the map x=cot(θ/2). Second, we initiate the study of the multiscale Galerkin method for the 2π-periodic hypersingular integral equation. The trigonometric wavelets are used as trial functions. Consequently, the 2j+1 × 2j+1 stiffness matrix Kj can be partitioned j×j block matrices. Furthermore, these block matrices are zeros except main diagonal block matrices. These main diagonal block matrices are symmetrical and circulant matrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform and the inverse fast Fourier transform instead of the inverse matrix. Finally, we provide several numerical examples to demonstrate our method has good accuracy even though the exact solutions are multi-peak and almost singular.     

Least squares solutions to AX = B for bisymmetric matrices under a central principal submatrix constraint and the optimal approximation

A matrix A∈R^n×n is called a bisymmetric matrix if its elements a_i,j satisfy the properties a_i,j=a_j,i and a_i,j=a_n-j+1,n-i+1 for 1?i,j?n. This paper considers least squares solutions to the matrix equation AX=B for A under a central principal submatrix constraint and the optimal approximation. A central principal submatrix is a submatrix obtained by deleting the same number of rows and columns in edges of a given matrix. We first discuss the specified structure of bisymmetric matrices and their central principal submatrices. Then we give some necessary and sufficient conditions for the solvability of the least squares problem, and derive the general representation of the solutions. Moreover, we also obtain the expression of the solution to the corresponding optimal approximation problem.     

A singular boundary value problem for odd-order differential equations

The odd-order differential equation (−1)ⁿx⁽²ⁿ⁺¹⁾=f(t,x,…,x⁽²ⁿ⁾) together with the Lidstone boundary conditions x^(2j)(0)=x^(2j)(T)=0, 0?j?n−1, and the next condition x⁽²ⁿ⁾(0)=0 is discussed. Here f satisfying the local Carathéodory conditions can have singularities at the value zero of all its phase variables. Existence result for the above problem is proved by the general existence principle for singular boundary value problems.     

Centers with degenerate infinity and their commutators

We study polynomial systems with degeneracy at infinity and a center-focus equilibrium at the origin. We give some general properties related to the existence of polynomial commutators and use these properties in order to characterize uniformly isochronous polynomial centers with polynomial commutator and, also, we show that the commutator of the centers of the analytic systems whose angular speed is constant can be chosen of radial form. Finally, we characterize the systems (−y+P_s+∑_j=kⁿ⁻¹xH_j,x+Q_s+∑_j=kⁿ⁻¹yH_j)^t with polynomial commutator, with P_j,Q_j,H_j and K_j homogeneous polynomials.     

Trigonometric variable shape parameter and exponent strategy for generalized multiquadric radial basis function approximation

The generalized multiquadric radial basis function (φ_j=[(x-x_j)²+c²]^β) has the exponent β and shape parameter c that play an important role in the accuracy of the approximation. In this study, we present a trigonometric variable shape parameter and exponent strategy and apply it to function interpolations and linear boundary value problems. Several numerical experiments with the uniformly spaced nodes show that the inverse multiquadric radial basis function (β = −0.5) with the trigonometric variable shape parameter c strategy results in the best accuracy for the one-dimensional interpolations; the trigonometric variable shape parameters and exponent strategy produces the best accuracy for the two-dimensional interpolations and linear boundary value problems. For the non-uniformly spaced nodes, the random variable shape parameter c and exponent β strategy produces the best accuracy for the two-dimensional boundary value problem.     

Uniform convergence of rows of the Padé table for functions with smooth Maclaurin series coefficients

Given a formal power seriesf(z)?∑ _j=0 ^∞ a _j z ^j for which the quantitya _j ?1a _j +1/a _j ² has a prescribed asymptotic behavior asj→∞, we obtain the asymptotic behavior of poles of rows of the Padé table, and the associated Toeplitz determinants. In particular, we can show for large classes of entire functions of zero, finite, and infinite order (including the Mittag-Leffler functions) and forn=1,2,3,..., that the poles of [m/n](z) approach ∞ with ratea _m /a _m+1 asm→∞.     

Small eigenvalues of large Hermitian moment matrices

We consider an infinite Hermitian positive definite matrix M which is the moment matrix associated with a measure μ with infinite and compact support on the complex plane. We prove that if the polynomials are dense in L²(μ) then the smallest eigenvalue λn of the truncated matrix Mn of M of size (n+1)×(n+1) tends to zero when n tends to infinity. In the case of measures in the closed unit disk we obtain some related results.     

Estimates of the smoothness of dyadic orthogonal wavelets of Daubechies type

Suppose that ω(φ, ·) is the dyadic modulus of continuity of a compactly supported function φ in L ²(?⁺) satisfying a scaling equation with 2 ⁿ coefficients. Denote by α _φ the supremum for values of α > 0 such that the inequality ω(φ, 2^?j ) ≤ C2 ^?αj holds for all j ∈ ?. For the cases n = 3 and n = 4, we study the scaling functions φ generating multiresolution analyses in L ²(?₊) and the exact values of α _φ are calculated for these functions. It is noted that the smoothness of the dyadic orthogonal wavelet in L ²(?₊) corresponding to the scaling function φ coincides with α _φ .     

On Ochoa's special matrices in matrix classes

It is well known that the ideal classes of an order Z[μ], generated over Z by the integral algebraic number μ, are in a bijective correspondence with certain matrix classes, that is, classes of unimodularly equivalent matrices with rational integer coefficients. If the degree of μ is ?3, we construct explicitly a particularly simple ideal matrix for an ideal which is a product of different prime ideals of degree 1. We obtain the following special n×n matrix (c_ij) in the matrix class corresponding to the ideal class of our ideal: c_i+1,_i=1(i=1,…,n?2); c_ij=0(?i?n, 1?j?n? 2, and i≠j+1); c_nj=0(j)=2,…,n?1). The remaining coefficients are given as explicit polynomials in an integer z which depends on the ideal. It is shown that the matrix class of every regular ideal class of Z[μ] contains a special matrix of this kind.     

The numerical range of a tridiagonal operator

Let r be a real number and A a tridiagonal operator defined by Aej=ej−1+rjej+1, j=1,2,…, where {e₁,e₂,…} is the standard orthonormal basis for ?²(N). Such tridiagonal operators arise in Rogers-Ramanujan identities. In this paper, we study the numerical ranges of these tridiagonal operators and finite-dimensional tridiagonal matrices. In particular, when r=−1, the numerical range of the finite-dimensional tridiagonal matrix is the convex hull of two explicit ellipses. Applying the result, we obtain that the numerical range of the tridiagonal operator is the square

     

r-Numbers completion problems of partial upper canonical form I

A pair (A, B), where A is an n × n matrix and B is an n × m matrix, is said to have the nonnegative integers sequence {r_j}_j=1^p as the r-numbers sequence if r₁ = rank(B) and r_j = rank[B AB … A^j−1 B] − rank[B AB … A^j−2B], 2 ≤ j ≤ p. Given a partial upper triangular matrix A of size n × n in upper canonical form and an n × m matrix B, we develop an algorithm that obtains a completion A_c of A, such that the pair (A^c, B) has an r-numbers sequence prescribed under some restrictions.     

Global singularization and the failure of SCH

We say that κ is μ-hypermeasurable (or μ-strong) for a cardinal μ≥κ⁺ if there is an embedding j:V→M with critical point κ such that H(μ)^V is included in M and j(κ)>μ. Such a j is called a witnessing embedding.Building on the results in [7], we will show that if V satisfies GCH and F is an Easton function from the regular cardinals into cardinals satisfying some mild restrictions, then there exists a cardinal-preserving forcing extension V^∗ where F is realised on all V-regular cardinals and moreover, all F(κ)-hypermeasurable cardinals κ, where F(κ)>κ⁺, with a witnessing embedding j such that either j(F)(κ)=κ⁺ or j(F)(κ)≥F(κ), are turned into singular strong limit cardinals with cofinality ω. This provides some partial information about the possible structure of a continuum function with respect to singular cardinals with countable cofinality.As a corollary, this shows that the continuum function on a singular strong limit cardinal κ of cofinality ω is virtually independent of the behaviour of the continuum function below κ, at least for continuum functions which are simple in that 2^α∈{α⁺,α⁺⁺} for every cardinal α below κ (in this case every κ⁺⁺-hypermeasurable cardinal in the ground model is witnessed by a j with either j(F)(κ)≥F(κ) or j(F)(κ)=κ⁺).     

A note on “Constructing matrices with prescribed off-diagonal submatrix and invariant polynomials”

Let F be any field and let B a matrix of F^q×p. Zaballa found necessary and sufficient conditions for the existence of a matrix A=[A_ij]_i,j∈{1,2}∈F^(p+q)×(p+q) with prescribed similarity class and such that A₂₁=B. In an earlier paper [A. Borobia, R. Canogar, Constructing matrices with prescribed off-diagonal submatrix and invariant polynomials, Linear Algebra Appl. 424 (2007) 615-633] we obtained, for fields of characteristic different from 2, a finite step algorithm to construct A when it exists. In this short note we extend the algorithm to any field.     

Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems

In this paper we present a minimal set of conditions sufficient to assure the existence of a solution to a system of nonnegative linear diophantine equations. More specifically, suppose we are given a finite item set U = {u₁, u₂, . . . , u_k} together with a "size" v_i ≡ v(u_i) ∈ Z⁺, such that v_i ≠ v_j for i ≠ j, a "frequency" a_i ≡ a(u_i) ∈ Z⁺, and a positive integer (shelf length) L ∈ Z⁺ with the following conditions: (i) L = ∏ⁿ_j=1p_j(p_j ∈ Z⁺ ∀j, p_j ≠ p_l for j ≠ l) and v_i = ∏ _j∈Aip_j, A_i ⊆ {l, 2, . . . , n} for i = 1, . . . , n; (ii) (A_i\{⋂^k_j=1A_j}) ∩ (A_l\{⋂^k_j=1A_j}) = ⊘∀i ≠ l. Note that v_i|L (divides L) for each i. If for a given m ∈ Z⁺, ∑ⁿ_i=1a_iv_i = mL (i.e., the total size of all the items equals the total length of the shelf space), we prove that conditions (i) and (ii) are sufficient conditions for the existence of a set of integers {b₁₁, b₁₂, . . . , b_1m, b₂₁, . . . , b_n1, . . . , b_nm}⊆ N such that ∑^m_j=1b_ij = a_i, i = 1, . . . , k, and ∑^k_i=1b_ijv_i = L, j =1, . . . , m (i.e., m shelves of length L can be fully utilized). We indicate a number of special cases of well known NP-complete problems which are subsequently decided in polynomial time.     

Explicit solutions for a two-phase unidimensional Lamé-Clapeyron-Stefan problem with source terms in both phases

A two-phase Stefan problem with heat source terms of a general similarity type in both liquid and solid phases for a semi-infinite phase-change material is studied. We assume the initial temperature is a negative constant and we consider two different boundary conditions at the fixed face x=0, a constant temperature or a heat flux of the form (q₀>0). The internal heat source functions are given by (j=1 solid phase; j=2 liquid phase) where βj=βj(η) are functions with appropriate regularity properties, ρ is the mass density, l is the fusion latent heat by unit of mass, is the diffusion coefficient, x is the spatial variable and t is the temporal variable. We obtain for both problems explicit solutions with a restriction for data only for the second boundary conditions on x=0. Moreover, the equivalence of the two free boundary problems is also proved. We generalize the solution obtained in [J.L. Menaldi, D.A. Tarzia, Generalized Lamé-Clapeyron solution for a one-phase source Stefan problem, Comput. Appl. Math. 12 (2) (1993) 123-142] for the one-phase Stefan problem. Finally, a particular case where βj (j=1,2) are of exponential type given by βj(x)=exp(−²(x+dj)) with x and dj∈R is also studied in details for both boundary temperature conditions at x=0. This type of heat source terms is important through the use of microwave energy following [E.P. Scott, An analytical solution and sensitivity study of sublimation-dehydration within a porous medium with volumetric heating, J. Heat Transfer 116 (1994) 686-693]. We obtain a unique solution of the similarity type for any data when a temperature boundary condition at the fixed face x=0 is considered; a similar result is obtained for a heat flux condition imposed on x=0 if an inequality for parameter q₀ is satisfied.     

Richardson's iteration for nonsymmetric matrices

To solve the linear N×N system (1) Ax=a for any nonsingular matrix A, Richardson's iteration (2) x_j+1=x_j-α_j(Ax_j-a), j=1,2,…,n, which is applied in a cyclic manner with cycle length n is investigated, where the α_j are free parameters. The objective is to minimize the error |x_n+1-x|, where x is the solution of (1). If the spectrum of A is known to lie in a compact set S, one is led to the Chebyshev-type approximation problem (3) min_p-1∈Vnmax_z∈S|p(z)|, where V_n is the linear span of z,z²,…,zⁿ. If p solves (3), then the reciprocals of the zeros of p are optimal iteration parameters α_j. It is shown that for a real problem (1) the iteration (2) can be carried out with real arithmetic alone, even when there are complex α_j. The stationary case n=1 is solved completely, i.e., for all compact sets S the problem (3) is solved explicitly. As a consequence, the converging stationary iteration processes can be characterized. For arbitrary closed disks S the problem (3) can be solved for all n∈$\text{N}$, and a simple proof is provided. The lemniscates associated with S are introduced. They appear as an important tool for studying the stability of the iteration (2).     

Matrix orthogonal polynomials associated with perturbations of block Toeplitz matrices

Let {c _j } _j=0 ⁿ be a sequence of matrix moments associated with a matrix of measures supported on the unit circle, and let {P _j } _j=0 ⁿ be its corresponding sequence of monic matrix orthogonal polynomials. In this contribution, we consider a perturbation on the moments and find an explicit relation for the perturbed orthogonal polynomials in terms of {P _j } _j=0 ⁿ . We also obtain an expression for the corresponding second kind polynomials.     

Zeros of a random algebraic polynomial with coefficient means in geometric progression

This paper provides the mathematical expectation for the number of real zeros of an algebraic polynomial with non-identical random coefficients. We assume that the coefficients {a_j}ⁿ⁻¹_j=0 of the polynomial T(x)=a₀+a₁x+a₂x²+?+a_n−1xⁿ⁻¹ are normally distributed, with mean E(a_j)=μ^j+1, where μ≠0, and constant non-zero variance. It is shown that the behaviour of the random polynomial is independent of the variance on the interval (−1,1); it differs, however, for the cases of |μ|<1 and |μ|>1. On the intervals (−∞,−1) and (1,∞) we find the expected number of real zeros is governed by an interesting relationship between the means of the coefficients and their common variance. Our result is consistent with those of previous works for identically distributed coefficients, in that the expected number of real zeros for μ≠0 is half of that for μ=0.