We present a path algorithm for the generalized lasso problem. This problem penalizes the `1 norm of a matrix D times the coefficient vector, and has a wide range of applications, dictated by the choice of D. Our algorithm is based on solving the dual of the generalized lasso, which facilitates computation and conceptual understanding of the path. For D = I (the usual lasso), we draw a connecti...

In 1995 T. J. Penna introduced a simple model of biological aging. A modified Penna model has been demonstrated to exhibit behaviour of real-life systems including catastrophic senescence in salmon and a mortality plateau at advanced ages. We present a general steady-state, analytic solution to the Penna model, able to deal with arbitrary birth and survivability functions. This solution is empl...

We present the exact solution for a set of nonlinear algebraic equations 1 zl = πd + 2d n ∑ m6=l 1 zl−zm . These were encountered by us in a recent study of the low energy spectrum of the Heisenberg ferromagnetic chain [1]. These equations are low d (density) “degenerations” of more complicated transcendental equation of Bethe’s Ansatz for a ferromagnet, but are interesting in themselves. They ...

An efŽ cient method has been developed for analyzing the three-dimensional electromechanical deformations of a monoclinic piezoelectric laminate subjected to surface tractions and electric displacements on the top and bottom surfaces. The procedure combines the transfer matrix method with the asymptotic expansion technique. The electromechanical coupled formulation is reduced to a hierarchy of ...

Two eecient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method and the second is an extension of Ham-marling's method to generalized Lyapunov equations. Our LAPACK based subroutines are implemented in a quite exible way. They can handle the transposed equations and provide scalin...

We consider an unconstrained minimization reformulation of the generalized complementarity problem GCP(f, g) when the underlying functions f and g are H-differentiable. We describe H-differentials of some GCP functions based on the min function and the penalized Fischer-Burmeister function, and their merit functions. Under appropriate semimonotone (E0), strictly semimonotone (E) regularity-cond...

Presented work deals with the interior regularity of solution to generalized Stokes problem. For this purpose the method of difference quotients is used. Some results from my diploma thesis are needed and will be sumarized in the first section. The second section contains the proof of the main theorem. Introduction For given datas Ω ⊂ Rd, A : Ω 7→ Rd2×d2 , B : Ω 7→ Rd2 , f : Ω 7→ Rd and g : Ω 7...

An iterative algorithm is constructed to solve the linear matrix equation pair AXB E, CXD F over generalized reflexive matrix X. When the matrix equation pair AXB E, CXD F is consistent over generalized reflexive matrix X, for any generalized reflexive initial iterative matrix X1, the generalized reflexive solution can be obtained by the iterative algorithm within finite iterative steps in the ...

In this paper, we establish an existence result of the solution for an generalized strong vector variational inequality already considered in the literature and as applications we obtain a new coincidence point theorem in Hilbert spaces.    

A new generalized solitary solution of the Jaulent–Miodek equations is obtained using the Exp-function method. By a transformation, the solitary solution can be easily converted into a generalized compacton-like solution. The free parameters in the obtained generalized solutions might imply some meaningful results in physical process. © 2007 Elsevier B.V. All rights reserved.