Let G(x) = [ eIm 0 c−1e−iνx + c0 + c1e e−iλxIm ] , where cj ∈ Cm×m, α, ν > 0 and α+ ν = λ. For rational α/ν such matrices G are periodic, and their Wiener-Hopf factorization with respect to the real line R always exists and can be constructed explicitly. For irrational α/ν, a certain modification (called an almost periodic factorization) can be considered instead. The case of invertible c0 and ...

Abstract— One of the important applications of Radar is to track and search the target in interfering environment. Which requires design of an array antenna with the most important property is, the ability to form precisely located deep pattern null for angle tracking. In this paper an attempt is made to analyze difference patterns for some of the odd symmetric excitation amplitude functions. T...

The present work approaches the problem of achieving the approximate solution of the second order initial value problems (IVPs) via its conversion into a Volterra integral equation of the second kind (VIE2). Therefore, we initially solve the IVPs using Runge–Kutta of the forth–order method (RK), and then convert it into VIE2, and apply the εmodified block–pulse functions (εMBPFs) and their oper...

The method of triangular functions (TF) could be a generalization form of the functions of block-pulse (Bp)‎. ‎The solution of second kind integral equations by using the concept of TF would lead to a nonlinear equations system‎. ‎In this article‎, ‎the obtained nonlinear system has been solved as a dynamical system‎. ‎The solution of the obtained nonlinear system by the dynamical system throug...

Factorizations of Wiener–Hopf type are considered in the abstract framework of Wiener algebras of matrix-valued functions on connected compact abelian groups, with a non-archimedean linear order on the dual group. A criterion for factorizability is established for 2 × 2 block triangular matrix functions with elementary functions on the main diagonal and a binomial expression in the off-diagonal...

We propose a divide-and-conquer algorithm for computing arbitrary functions of upper triangular matrices, which requires approximately the same number of arithmetic operations as Parlett’s algorithm. However, the new algorithm has better performance on computers with two levels of memory due to its block structure and thus, less memory-cache traffic requirements. Like Parlett’s algorithm, the n...