02-17-2016
Thanks rudic, I tried that code but nothing changed. I can get the original code I used to work as long as the objective letter is by itself e.g. not part of a 2+ letter word.
10 More Discussions You Might Find Interesting
1. Programming
I need to write a make script to install a C module in a UNIX
environment.It should install the sources, build the libraries and
install them and also install the info pages on the system.
Can this script be general enough to also install on
windows, windows dll, windows help file's etc. Any... (3 Replies)
Discussion started by: cherio
3 Replies
2. Shell Programming and Scripting
is there a way to make my script wait before doing something without using the "sleep _" command? (4 Replies)
Discussion started by: Blip
4 Replies
3. Shell Programming and Scripting
Is there any method to realise this in one command?
Thanks in advance (2 Replies)
Discussion started by: GCTEII
2 Replies
4. Shell Programming and Scripting
Hi,
I try to write a script to create a new directory.
#!/bin/bash
echo "Please enter folder name (6 characters only) :"
read foldername
mkdir /home/user/$foldername
$foldername >> /home/list/list.txt
My question/situation:
1) how to ensure the folder name MUST BE 6 characters... (0 Replies)
Discussion started by: malaysoul
0 Replies
5. Shell Programming and Scripting
Hi,
I have a very basic knowledge of Unix and I need your help for a small script that will do the following commands that I do manually by just giving the filename TPR20080414.txt
cut -d'|' -f3,4 TPR20080414.txt> oe_012.lkp
awk -F "|" '{temp=$1;$1=$2;$2=temp}1' OFS="|" oe_012.lkp >... (3 Replies)
Discussion started by: sickboy
3 Replies
6. Shell Programming and Scripting
Hi,
I have a script that ftp over the file:
CFGFILE=/export/home/myuser/scripts/ftp1.cfg
LOGFILE=/app/bea/logs/
LOCALPATH=/expport/home/myuser/ECNLogs/
YEAR=`date '+%Y'`
MONTH=`date '+%m'`
DAY=`date '+%d'`
HOUR=`date '+%H'`
MINUTE=`date '+%M'`
LASTHOUR=$((HOUR-1))
echo $LASTHOUR
... (4 Replies)
Discussion started by: mehrdad68
4 Replies
7. Shell Programming and Scripting
Hi All,
I have a script which throws the output if condition matches. I run the cmd :
# ldf
Filesystem kbytes used avail capacity Mounted on
/dev/dsk/c1t0d0s0 1984564 1375019 550009 72% /
/dev/dsk/c1t0d0s3 5040814 2628410 2361996 53% /usr... (4 Replies)
Discussion started by: naw_deepak
4 Replies
8. Shell Programming and Scripting
Good morning. I am searching for "how-to"'s for some particular questions:
1. How to write a script in HP-UX 11.
2. How to schedule a script.
3. How to "call" scripts from the original script.
4. How to su to another user from within a script.
This is the basics of what the... (15 Replies)
Discussion started by: instant000
15 Replies
9. UNIX for Dummies Questions & Answers
if i have a script called test.sh
file1=$(ls -l|awk '{print $9 $1}')
awk ' /date_of_selling:/ { print $6 ":" &9 }' /$file1 >> data.txt
if i wanna this script to run automatically every day at 8 am :D (3 Replies)
Discussion started by: teefa
3 Replies
10. Shell Programming and Scripting
How do we create a shell script that creates a makefile?
what if we want to use the #include header files too? (2 Replies)
Discussion started by: sslokhan
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)