03-20-2009
What have you tried so far to solve the issue?
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
HI
In my script, i am reading the input from the user and want to find the length of the string.
The input may contain leading spaces. Right now, when leading spaces are there, they are not counted.
Kindly help me
My script is like below. I am using the ksh.
#!/usr/bin/ksh
echo... (2 Replies)
Discussion started by: dayamatrix
2 Replies
2. Shell Programming and Scripting
hi i have two files and i want to compare both the files and find out mismatch in 3rd file
file1
00354|1|0|1|1|0|0|0|1|2
52424|1|0|1|1|0|0|0|1|2
43236|1|0|1|1|0|0|0|1|2
41404|1|0|1|1|0|0|0|1|2
79968|1|0|1|1|0|0|0|1|2
file2
00354|1|0|1|1|0|0|0|1|2
52424|1|0|1|1|0|0|0|0|2... (9 Replies)
Discussion started by: dodasajan
9 Replies
3. Shell Programming and Scripting
I have a textfile containing text similar to the following pattern:
STRING1
UNIQUE_STRING1
STRING2
STRING3
STRING4
STRING5
STRING1
UNIQUE_STRING2
STRING2
STRING3
STRING4
STRING5
STRING1
UNIQUE_STRING3
STRING2
STRING3 (6 Replies)
Discussion started by: ilcsfe
6 Replies
4. Shell Programming and Scripting
What's the easiest way to search a file for a specific string and then look for other instances after that? I want to search for all Virtual Hosts and print out the Server Name and Document Root (if it has that info), while discarding the rest of the info.
Basically my file looks like this:
...... (6 Replies)
Discussion started by: Mbohmer
6 Replies
5. Linux
Hi all,
I have a question..
Here is my requirement..I have 500 files in a path say /a/b/c
I have some numbers in a file which are comma seperated...and I wanted to check if the numbers are present in the FileName in the path /a/b/c..if the number is there in the file that is fine..but if... (1 Reply)
Discussion started by: us_pokiri
1 Replies
6. UNIX for Dummies Questions & Answers
Hi
I have used the below steps and found some discrepancies
step 1 :
find ./ -type f -mtime +7 -name "*.00*" | wc -l = 13519 ( total files )
( the size of this files is appx : 10GB )
step 2:
find ./ -type f -mtime +7 -name "*.00*" | xargs tar zcvf Archieve_7.tar.gz
step... (7 Replies)
Discussion started by: rakeshkumar
7 Replies
7. Shell Programming and Scripting
Hi,
Here's my dilemma.
I need to replace the string Sept_2012 to Oct_2012 in all *config.py files within the current directory and below directories
Is this possible?
Also I am trying to find all instances of the string Sept_2012 within files in the current directory and below
I have... (13 Replies)
Discussion started by: pure_jax
13 Replies
8. Shell Programming and Scripting
Hello
I would like to get know how to do this:
I got a big file (about 1GB) and I need to find a string (for instance by grep )
and then find all records in this file based on a string.
Thanks for advice.
Martin (12 Replies)
Discussion started by: mape
12 Replies
9. Shell Programming and Scripting
Hi,
I did some research but cannot find the right solution so hopefully someone can help me here.
I have a long string format like:
VAR=111:aaaa,222:bbb,333:ccc
it could be
VAR=111:aaa,222:bbb,333:ccc,444:ddd, etc
what I looking for is eg.
if I give ccc, it will return me 333... (2 Replies)
Discussion started by: netbanker
2 Replies
10. Shell Programming and Scripting
Hello,
I have written a syllable splitter for Pseudo English and Indic.
I have a large database with the following structure
Syllables in Pseudo English delimited by |=Syllables in Devanagari delimited by |
The tool produces syllables in both scripts. An example is given below:
... (2 Replies)
Discussion started by: gimley
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)