The absolute value equations (AVE) problem is an algebraic of solving . So far, most the research has focused on methods for AVE, but we address itself by analyzing properties AVE and corresponding solution set. In particular, investigate topological set, such as convexity, boundedness, or connectedness, whether it consists finitely many solutions. Further, problems related to nonnegativity sol...

In this paper, by equivalently reformulating the absolute value equation (AVE) into an alternative two-by-two block nonlinear equation, we put forward SOR-like (ASOR-like) iteration method to solve AVE. The convergence of ASOR-like is established, subjecting specific restrictions placed on associated parameter. selection optimal parameter investigated theoretically. Numerical experiments are gi...

The compact genome of Fugu rubripes, with its very small introns, appears to be particularly suitable to study intron-encoded functions. We have analyzed the Fugu gene for ribosomal protein S7 (formerly S8, see Note), whose Xenopus homolog contains in its introns the coding sequences for the small nucleolar RNA U17. Except for intron length, the organization of the Fugu S7 gene is very similar ...

We propose a hybrid algorithm for solving the NP-hard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving iteratively a linear system of equations followed by a linear program. The algorithm was tested on 100 consecutively generated random solvable instances of the AVE with n =50...

By utilizing a dual complementarity property, we propose a new linear programming method for solving the NP-hard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving a few linear programs, typically less than four. The algorithm was tested on 500 consecutively generated random sol...

Center for Nanoscale Materials, Argonne Lemont, IL 60439, USA. E-mail: kpelzer@an Materials Science Division, Argonne Nation 60439, USA Argonne Leadership Computing Facility, A Ave., Lemont, IL 60439, USA Theoretical Division, Center for Nonl Nanotechnologies, Los Alamos National Lab Mathematics and Computer Science Divis Cass Ave., Argonne, IL 60439, USA Computation Institute, University of Ch...

We propose a finitely terminating primal-dual bilinear programming algorithm for the solution of the NP-hard absolute value equation (AVE): Ax− |x| = b, where A is an n× n square matrix. The algorithm, which makes no assumptions on AVE other than solvability, consists of a finite number of linear programs terminating at a solution of the AVE or at a stationary point of the bilinear program. The...

AIM Wearable technology interfaces with normal human movement and function, thereby enabling more efficient and adaptable use.We developed a wearable display system for use with intra-operative neuronavigation for brain tumor surgery. MATERIAL AND METHODS The Google glass head-up display system was adapted to surgical loupes with a video-streaming integrated hardware and software device for d...

Ribosomal protein S7 of Saccharomyces cerevisiae is encoded by two genes RPS7A and RPS7B. The sequence of each copy was determined; their coding regions differ in only 14 nucleotides, none of which leads to changes in the amino acid sequence. The predicted protein consists of 261 amino acids, making it the largest protein of the 40 S ribosomal subunit. It is highly basic near the NH2 terminus, ...