06-24-2011
Did you solve it?
Last edited by vbe; 06-24-2011 at 04:53 AM..
Reason: typo
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi,
If I want to have a look at few lines of the file, how do I, what command to use.
Eg: If I have a file having length 2000 lines and I want to have a look at the content between 1400 and 1600, How do I look at it ?
Also, If I want to have a look at function alone in a file, how do I go... (4 Replies)
Discussion started by: sharuvman
4 Replies
2. UNIX for Dummies Questions & Answers
This is truly dummy question.
I have a text file of 100 lines.
What unix commnad to extract line 20 to 40 and output it to another file?
Is it something cat or grep or >> ?
Thanks (6 Replies)
Discussion started by: champion
6 Replies
3. UNIX for Dummies Questions & Answers
I have a file that has 1k lines and i want to print all the lines after 900th line.
an 2)I want to move files f1 ,f2,f3,f4 to p1,p2,p3,p4
Please give me the commands.
Thanx in adv. (6 Replies)
Discussion started by: rajashekar.y
6 Replies
4. Shell Programming and Scripting
Hi,
I am sure this is possible in awk or sed or a combination of the two.
Can someone help me determine the best way to display or print certain section of a file, ie only certain number of lines.
Example: File1 1 has 20 lines.
I need to be able to print from line 5 to line 10 of this file.... (2 Replies)
Discussion started by: jerardfjay
2 Replies
5. Shell Programming and Scripting
Hi
to all in this great forum, im sure this has been asked lots of times before but ive been looking for the past day and cant find the answer.
I use cat/some/file to display its contents but how can i get it to not display hashed out lines, or do i need another command,
Thanks in advance:) (5 Replies)
Discussion started by: dave123
5 Replies
6. Shell Programming and Scripting
I have a file with a list of config files numbered on the lefthand side 1-300. I need to have bash read each lines number and assign it to a variable so it can be chosen by the user called by the script later.
Ex. 1 some data
2 something else
3 more stuff
which number do you... (1 Reply)
Discussion started by: glev2005
1 Replies
7. Shell Programming and Scripting
Hello
Wondering if anybody can advise me how I can sort the below file so it only displays lines with the latest versions of an object? As you'll see some of the scripts listed in my file have more than one version number (version number is after the file extension). E.g. cdm_bri.pkb has... (2 Replies)
Discussion started by: Glyn_Mo
2 Replies
8. UNIX for Advanced & Expert Users
Hi all
Thanks in advance...........
Please help me for this issue............
I have a file it has 11 records . I used the command like ....
>$ wc -l file
11 file
I'm getting output like 11 file (no.of records along with filename)
here my requirement is, I want to display only... (3 Replies)
Discussion started by: ksrivani
3 Replies
9. Shell Programming and Scripting
awk 'BEGIN{IGNORECASE=1} /error|warning|exception/ { ++x } END { print x }' filename
The above command returning the number of times the pattern present in the file. But I want the the line number as well. please help me out (6 Replies)
Discussion started by: arukuku
6 Replies
10. Shell Programming and Scripting
Hi Guys,
I want to echo last 5 lines of a file to a mail. My script getting continuously looped and not getting the output. can anyone help?
#!/bin/bash
read karthick;
tail -5 $karthick;
echo $karthick | mail -s "genius" someone@gmail.com
Thanks
NK (2 Replies)
Discussion started by: Karthick N
2 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)