04-11-2011
thank all, allready solve
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi All,
I need a shell script to join a line to the line that follows it. But I shouldn't do it for all the lines. I need to join a line having the character say '&' at the end of the line & need to join the line that follows it.
E.g
Input
1. This is the first line &
2. and the second... (6 Replies)
Discussion started by: shashi_kiran_v
6 Replies
2. Shell Programming and Scripting
Hi,
Can we use shell script to combine multiple file ?
For example we have 3 file
1.txt
2.txt
3.txt
and the result should be : (6 Replies)
Discussion started by: justbow
6 Replies
3. Shell Programming and Scripting
i had a file where lines appear to be broken when they shouldn't
eg
Line 1. kerl abc sdskd sdsjkdlsd sdsdksd \
Line 2. ksdkks sdnjs djsdjsd
i can do a shift join to combine the lines but i there are plenty of files with this issue
Line 1. kerl abc sdskd sdsjkdlsd sdsdksd ksdkks sdnjs... (6 Replies)
Discussion started by: mad_man12
6 Replies
4. Shell Programming and Scripting
Hello,
Did anyone know how to write a perl script to merge the multi-line into a single line where each line with start at timestamp
Input-->
timestamp=2009-11-10-04.55.20.829347;
a;
b;
c;
timestamp=2009-11-10-04.55.20.829347;
aa;
bb;
cc; (5 Replies)
Discussion started by: happyday
5 Replies
5. Shell Programming and Scripting
Hello,
Did any one know how to use perl join line and add | in front
Input-->
timestamp=2009-11-10-04.55.20.829347;
a;
b;
c;
ddaa;
timestamp=2009-11-10-04.55.20.829347;
aa;
bb;
cc;
Output-->
... (2 Replies)
Discussion started by: happyday
2 Replies
6. Shell Programming and Scripting
Hello Everybody,
I am New to Unix Environment, and need some help.
Basically i have got a file named XYZ.txt with following pattern.
CR Len:102 Typ:1 Nro:71818037 Chk:1 Tim:2011-07-16/08:46:03 oiw:3 oTy:145 oAd:50206 diw:0 dTy:145 dAd:919399951328 SMC:919821900040
iTm:2011-07-16/08:46:03... (5 Replies)
Discussion started by: spiabhi
5 Replies
7. Shell Programming and Scripting
Hi
I am trying to figureout how to join output of two command in unix in the same line.
for e.g.
$ankit : df -h | egrep -w /home | awk '{print -n $1 "\t" $5}' ;stat --format=%a /home
Output:
0148G /home
775
I want this output as...
0148G /home 775
Please let me know if you... (7 Replies)
Discussion started by: kotak86
7 Replies
8. Shell Programming and Scripting
Hi
I have a file like
1 2
1 2 3
1 5 6
11 12
10 2
7 5
17 12
I would like to have an output as
1 2 3 5 6 10 7
11 12 17
any help would be highly appreciated
Thanks (4 Replies)
Discussion started by: Harrisham
4 Replies
9. Shell Programming and Scripting
Hi guys,
I hope you are doing well!
I have a file and I need to join two lines into one, but the second line I need only the last two columns.
=================
"eHealth Trend Report","logoRpt"
"LAN/WAN Group 123"
"Divide by Time"
"switch1_a-RH-Serial0"
"BW: 1.02 M"
... (4 Replies)
Discussion started by: antoniorajr
4 Replies
10. Shell Programming and Scripting
I've input as ,
abcd|
ef
123456|
78|
90
Desired output as,
abcdef
1234567890
Anyone please give the solution. (5 Replies)
Discussion started by: jinixvimal
5 Replies
LEARN ABOUT DEBIAN
solver
solver(2rheolef) rheolef-6.1 solver(2rheolef)
NAME
solver - direct or interative solver interface
DESCRIPTION
The class implements a matrix factorization:
LU factorization for an unsymmetric matrix and
Choleski fatorisation for a symmetric one.
Let a be a square invertible matrix in
csr format (see csr(2)).
csr<Float> a;
We get the factorization by:
solver<Float> sa (a);
Each call to the direct solver for a*x = b writes either:
vec<Float> x = sa.solve(b);
When the matrix is modified in a computation loop but
conserves its sparsity pattern, an efficient re-factorization
writes:
sa.update_values (new_a);
x = sa.solve(b);
This approach skip the long step of the symbolic factization step.
ITERATIVE SOLVER
The factorization can also be incomplete, i.e. a pseudo-inverse,
suitable for preconditionning iterative methods.
In that case, the sa.solve(b) call runs a conjugate gradient
when the matrix is symmetric, or a generalized minimum residual
algorithm when the matrix is unsymmetric.
AUTOMATIC CHOICE AND CUSTOMIZATION
The symmetry of the matrix is tested via the a.is_symmetric() property
(see csr(2)) while the choice between direct or iterative solver
is switched from the a.pattern_dimension() value. When the pattern
is 3D, an iterative method is faster and less memory consuming.
Otherwhise, for 1D or 2D problems, the direct method is prefered.
These default choices can be supersetted by using explicit options:
solver_option_type opt;
opt.iterative = true;
solver<Float> sa (a, opt);
See the solver.h header for the complete list of available options.
IMPLEMENTATION NOTE
The implementation bases on the pastix library.
IMPLEMENTATION
template <class T, class M = rheo_default_memory_model>
class solver_basic : public smart_pointer<solver_rep<T,M> > {
public:
// typedefs:
typedef solver_rep<T,M> rep;
typedef smart_pointer<rep> base;
// allocator:
solver_basic ();
explicit solver_basic (const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
void update_values (const csr<T,M>& a);
// accessors:
vec<T,M> trans_solve (const vec<T,M>& b) const;
vec<T,M> solve (const vec<T,M>& b) const;
};
// factorizations:
template <class T, class M>
solver_basic<T,M> ldlt(const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
template <class T, class M>
solver_basic<T,M> lu (const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
template <class T, class M>
solver_basic<T,M> ic0 (const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
template <class T, class M>
solver_basic<T,M> ilu0(const csr<T,M>& a, const solver_option_type& opt = solver_option_type());
typedef solver_basic<Float> solver;
SEE ALSO
csr(2), csr(2)
rheolef-6.1 rheolef-6.1 solver(2rheolef)