JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for COMP-FORTRAN-90 Archives


COMP-FORTRAN-90 Archives

COMP-FORTRAN-90 Archives


COMP-FORTRAN-90@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

COMP-FORTRAN-90 Home

COMP-FORTRAN-90 Home

COMP-FORTRAN-90  2001

COMP-FORTRAN-90 2001

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

A challenge for an ingenious interface

From:

Aleksandar Donev <[log in to unmask]>

Reply-To:

Fortran 90 List <[log in to unmask]>

Date:

Sun, 29 Apr 2001 11:31:42 -0400

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (93 lines)

Hi (warning: this is an entangled message),

For all those library writers, I have a tough design decision to make about
the interface between my network optimization library and the user, and I
keep bouncing back and forth in ideas in loops, so I want to get some help:

Assume that there is a user "cost" function c=f(x), where x is the "flow".
The derivatives of this cost function are the "potential" g=f'(x) and
"resistance" h=f''(x). The potential is invertible, that is, either knowing
the flow or knowing the potential determines all the rest uniquely via
x=(f')^(-1)(g). All these are assumed to be expensive (order of several
exponentiation operations) to calculate.

In various parts of my algorithm what is known (flow or potential) will
change from only the flow known at some point, or only the potential known,
*or both* (from previous calculations, while the other value may be
approximately known (and so can be used as a guess in any iterative
algorithm there may be for calculating these), or may not be known.
So, the possible input combinations are (K is known, A is approximate, U is
unknown):
1. K: x, K: g
2. K: x, A: g
3. K: x, U: g
4. U: x, K: g
5. A: x, K: g
The cost c and resistance r are always assumed to be unknown U to avoid too
many possibilities.

For each set of these possible inputs, we may want to calculate any number
of the unknown or approximate values. If we denote with N the fact that a
value needs to be calculated, and with I that that value is not needed
(ignored), a possible situation may be:
K: x, A, N:g, U, N:r, U, I: c

So now you get the gist that there are *many* possibilities. The important
part is that for some cost functions f things may be more quickly calculated
from the flow, but for some the potential may be the more natural
independent variable (as I said one or the other uniquely determines all the
rest). Another important thing is that computation may be saved considerably
if more values are bundled together.

For example, if f(x)=x^a, where a is a real number (exponentiation is
expensive), then g=f'(x)=a*x^(a-1) must be calculated expensively. But now
assume that at the same point we want the resistance too. Then we can save
ourselves half the time by doing:

temp=x^a ! The expensive part--if f is known approximately, then it can be
used as a starting guess in Newton's iteration for calculating this
if needed: f=temp
if needed: g=a*temp/x
if needed: h=a*(a-1)*temp/x/x or if g is already calculated h=(a-1)*g/x

So, I want to put the whole burden of these possibilities to the user. In
some old (and new) codes, reverse communication is used for this--the user
is told what is needed and what is known or approximate, and then he needs
to perform the calculation and call the optimization library again. In my
case, notice that the calculations described here will have to be carried
out in an inner loop many times (maybe for different powers a).

I do not like reverse-communication. Instead, I want the user to provide a
routine (a dummy argument) for the optimization library, that will accept a
valid combination of inputs and desired outputs (such as K: x, A, N:g, U,
N:r, U, I: c) and calculate the values that have the N on them.

The problem is on how to make an interface to this routine, because of all
the possibilities. For example, the values that are U,I need not even be
present in the argument list, the values with K are INTENT(IN), and the
others are INOUT or OUT. As I mentioned, this routine is expected to be
expensive, but it should not do most of its calculation in IF statements and
CASE structures. So a balance between efficiency and ease-of-use/writing is
needed.

If anyone has an idea of how to write an interface for such a function (and
then the next step is actually writing the function for say f(x)=x^a.I know
that doing things this way is not the standard approach to user-library
interfacing, but I think it may be a good approach that allows the user a
lot of flexibility in choosing the fastest approach, while giving me inside
the library a simple way of using this user input and passing it around as
just one dummy argument procedure.

Thanks a lot for listening,
Aleksandar

_____________________________________________
Aleksandar Donev
http://www.pa.msu.edu/~donev/
[log in to unmask]
(517) 432-6770
Department of Physics and Astronomy
Michigan State University
East Lansing, MI 48824-1116
_____________________________________________

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

December 2023
February 2023
November 2022
September 2022
February 2022
January 2022
June 2021
November 2020
September 2020
June 2020
May 2020
April 2020
December 2019
October 2019
September 2019
March 2019
February 2019
January 2019
November 2018
October 2018
September 2018
August 2018
July 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
December 2015
November 2015
October 2015
September 2015
August 2015
June 2015
April 2015
March 2015
January 2015
December 2014
November 2014
October 2014
August 2014
July 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
July 2013
June 2013
May 2013
April 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
August 2010
July 2010
June 2010
March 2010
February 2010
January 2010
December 2009
October 2009
August 2009
July 2009
June 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager