Hello to everyone! I'm pretty tired and I cannot concentrate properly, but I need some help!!!
I have a matrix like the one in the attachment (matrice_prova) and I would like an output like this:
How is it possible do that in Perl or Awk??
Any suggestion!?!? please to receive! thank you in advance!
I have a requirement to transpose the below xml which is in a text file on unix:
<?xml version="1.0" ?>
<REQUEST>
<ID>XXX</ID>
<TIMESTAMP>20090720062610</TIMESTAMP>
<FLAG>Y</FLAG>
<TO_FLAG>Y</TO_FLAG>
</REQUEST>
to
<?xml version="1.0"... (13 Replies)
TRANSPOSE
--------------------------------------------------------------------------------
i have a file with recurring fields
Start
A 1
B 2
C 3
D 4
E 5
End
Start
A 11
B 12
C 23
D 25
E 21 (1 Reply)
Hi all,
Is there a way to convert full data matrix to linearised left data matrix?
e.g full data matrix
Bh1 Bh2 Bh3 Bh4 Bh5 Bh6 Bh7
Bh1 0 0.241058 0.236129 0.244397 0.237479 0.240767 0.245245
Bh2 0.241058 0 0.240594 0.241931 0.241975 ... (8 Replies)
Hi everyone
I am very new at awk but think that that might be the best strategy for this. I have a matrix very similar to a correlation matrix and in practical terms I need to convert it into a list containing the values from the matrix (one value per line) with the first field of the line (row... (5 Replies)
Dear All
I was wondering how to resolve an issue that I met during my analysis. In particular I have a file like this(tab separated):
factor1 element1 chr1 309343146 330945480 1 protein_coding geneA
factor2 element2 chr2 309350853 309603230 1 protein_coding geneA
factor3 element3 chr3... (2 Replies)
Hi, Is it possible to transpose the matrix like this using awk ? Many thanks in advance
Input
abc Name_1 0
abc Name_2 1
abc Name_3 2
abc Name_4 0.4
def Name_1 0
def Name_2 9
def Name_3 78
def Name_4 1
Output
abc def
Name_1 0 ... (4 Replies)
This is my first post, I apologize if I have broken rules.
Some assistance with the following will be very helpful.
I have a couple of files, both should ultimately have common columns only, arranged in the same order.
This file needs to be transposed, to bring the rows to columns
... (2 Replies)
Hi All,
I have sort of a case to transpose data from rows to column
input data
Afghanistan|10000|1
Albania|25000|4
Algeria|25000|7
Andorra|10000|4
Angola|25000|47
Antigua and Barbuda|25000|23
Argentina|5000|3
Armenia|100000|12
Aruba|20000|2
Australia|50000|2
I need to transpose... (3 Replies)
Discussion started by: radius
3 Replies
LEARN ABOUT DEBIAN
mixed_solver
mixed_solver(4rheolef) rheolef-6.1 mixed_solver(4rheolef)NAME
pcg_abtb, pcg_abtbc, pminres_abtb, pminres_abtbc -- solvers for mixed linear problems
SYNOPSIS
template <class Matrix, class Vector, class Solver, class Preconditioner, class Size, class Real>
int pcg_abtb (const Matrix& A, const Matrix& B, Vector& u, Vector& p,
const Vector& Mf, const Vector& Mg, const Preconditioner& S1,
const Solver& inner_solver_A, Size& max_iter, Real& tol,
odiststream *p_derr = 0, std::string label = "pcg_abtb");
template <class Matrix, class Vector, class Solver, class Preconditioner, class Size, class Real>
int pcg_abtbc (const Matrix& A, const Matrix& B, const Matrix& C, Vector& u, Vector& p,
const Vector& Mf, const Vector& Mg, const Preconditioner& S1,
const Solver& inner_solver_A, Size& max_iter, Real& tol,
odiststream *p_derr = 0, std::string label = "pcg_abtbc");
The synopsis is the same with the pminres algorithm.
EXAMPLES
See the user's manual for practical examples for the nearly incompressible elasticity, the Stokes and the Navier-Stokes problems.
DESCRIPTION
Preconditioned conjugate gradient algorithm on the pressure p applied to the stabilized stokes problem:
[ A B^T ] [ u ] [ Mf ]
[ ] [ ] = [ ]
[ B -C ] [ p ] [ Mg ]
where A is symmetric positive definite and C is symmetric positive and semi-definite. Such mixed linear problems appears for instance with
the discretization of Stokes problems with stabilized P1-P1 element, or with nearly incompressible elasticity. Formaly u = inv(A)*(Mf -
B^T*p) and the reduced system writes for all non-singular matrix S1:
inv(S1)*(B*inv(A)*B^T)*p = inv(S1)*(B*inv(A)*Mf - Mg)
Uzawa or conjugate gradient algorithms are considered on the reduced problem. Here, S1 is some preconditioner for the Schur complement
S=B*inv(A)*B^T. Both direct or iterative solvers for S1*q = t are supported. Application of inv(A) is performed via a call to a solver
for systems such as A*v = b. This last system may be solved either by direct or iterative algorithms, thus, a general matrix solver class
is submitted to the algorithm. For most applications, such as the Stokes problem, the mass matrix for the p variable is a good S1 precon-
ditioner for the Schur complement. The stoping criteria is expressed using the S1 matrix, i.e. in L2 norm when this choice is considered.
It is scaled by the L2 norm of the right-hand side of the reduced system, also in S1 norm.
rheolef-6.1 rheolef-6.1 mixed_solver(4rheolef)